./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_4+newton_2_7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_4+newton_2_7.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5365e3b9adf0a1dadb935cfdb4266af37826f3120fbeff3f7ce577b21fb856a6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:52:22,569 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:52:22,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:52:22,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:52:22,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:52:22,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:52:22,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:52:22,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:52:22,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:52:22,652 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:52:22,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:52:22,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:52:22,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:52:22,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:52:22,655 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:52:22,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:52:22,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:52:22,655 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:52:22,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:52:22,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:52:22,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:52:22,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:52:22,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:52:22,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:52:22,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:52:22,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:52:22,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:52:22,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:52:22,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:52:22,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:52:22,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:52:22,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:52:22,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:52:22,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:52:22,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:52:22,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:52:22,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:52:22,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:52:22,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:52:22,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:52:22,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:52:22,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:52:22,666 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5365e3b9adf0a1dadb935cfdb4266af37826f3120fbeff3f7ce577b21fb856a6 [2024-11-08 16:52:22,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:52:22,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:52:22,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:52:22,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:52:22,885 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:52:22,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_2_7.i [2024-11-08 16:52:24,177 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:52:24,301 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:52:24,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_7.i [2024-11-08 16:52:24,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e797a5908/c48eb22e69de4741aea41af002f4b468/FLAGd8d7a611b [2024-11-08 16:52:24,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e797a5908/c48eb22e69de4741aea41af002f4b468 [2024-11-08 16:52:24,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:52:24,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:52:24,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:52:24,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:52:24,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:52:24,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166315d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24, skipping insertion in model container [2024-11-08 16:52:24,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:52:24,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_7.i[1224,1237] [2024-11-08 16:52:24,558 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_7.i[2827,2840] [2024-11-08 16:52:24,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:52:24,575 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:52:24,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_7.i[1224,1237] [2024-11-08 16:52:24,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_7.i[2827,2840] [2024-11-08 16:52:24,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:52:24,637 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:52:24,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24 WrapperNode [2024-11-08 16:52:24,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:52:24,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:52:24,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:52:24,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:52:24,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,665 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 79 [2024-11-08 16:52:24,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:52:24,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:52:24,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:52:24,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:52:24,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,688 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-08 16:52:24,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:52:24,699 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:52:24,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:52:24,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:52:24,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24" (1/1) ... [2024-11-08 16:52:24,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:52:24,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:52:24,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:52:24,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:52:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:52:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-08 16:52:24,765 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-08 16:52:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-08 16:52:24,765 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-08 16:52:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:52:24,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 16:52:24,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:52:24,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:52:24,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 16:52:24,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 16:52:24,818 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:52:24,820 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:52:24,971 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-08 16:52:24,971 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:52:24,982 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:52:24,982 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:52:24,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:52:24 BoogieIcfgContainer [2024-11-08 16:52:24,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:52:24,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:52:24,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:52:24,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:52:24,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:52:24" (1/3) ... [2024-11-08 16:52:24,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a80e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:52:24, skipping insertion in model container [2024-11-08 16:52:24,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:24" (2/3) ... [2024-11-08 16:52:24,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a80e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:52:24, skipping insertion in model container [2024-11-08 16:52:24,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:52:24" (3/3) ... [2024-11-08 16:52:24,989 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_7.i [2024-11-08 16:52:25,001 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:52:25,001 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 16:52:25,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:52:25,044 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@b635859, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:52:25,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 16:52:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 32 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 16:52:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 16:52:25,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:25,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:25,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:25,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:25,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1780479560, now seen corresponding path program 1 times [2024-11-08 16:52:25,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:25,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774126791] [2024-11-08 16:52:25,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:25,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:25,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:25,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774126791] [2024-11-08 16:52:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774126791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:25,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:25,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:52:25,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869763316] [2024-11-08 16:52:25,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:25,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:52:25,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:25,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:52:25,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:25,330 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 32 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:25,371 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2024-11-08 16:52:25,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:52:25,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 16:52:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:25,381 INFO L225 Difference]: With dead ends: 84 [2024-11-08 16:52:25,381 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 16:52:25,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:25,388 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:25,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 85 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:52:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 16:52:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-08 16:52:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:52:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-08 16:52:25,420 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2024-11-08 16:52:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:25,420 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-08 16:52:25,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-08 16:52:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 16:52:25,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:25,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:25,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:52:25,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:25,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:25,422 INFO L85 PathProgramCache]: Analyzing trace with hash 413626440, now seen corresponding path program 1 times [2024-11-08 16:52:25,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:25,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916634369] [2024-11-08 16:52:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:25,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:25,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:25,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916634369] [2024-11-08 16:52:25,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916634369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:25,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:25,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:52:25,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211039640] [2024-11-08 16:52:25,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:25,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:52:25,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:25,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:52:25,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:25,487 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:25,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:25,507 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2024-11-08 16:52:25,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:52:25,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 16:52:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:25,508 INFO L225 Difference]: With dead ends: 52 [2024-11-08 16:52:25,509 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 16:52:25,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:25,511 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:25,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:52:25,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 16:52:25,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 16:52:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:52:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-08 16:52:25,517 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 13 [2024-11-08 16:52:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:25,518 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-08 16:52:25,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:25,518 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-08 16:52:25,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 16:52:25,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:25,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:25,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:52:25,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:25,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:25,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1715037691, now seen corresponding path program 1 times [2024-11-08 16:52:25,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:25,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493541280] [2024-11-08 16:52:25,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:25,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:25,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:25,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493541280] [2024-11-08 16:52:25,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493541280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:25,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:25,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:52:25,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238795840] [2024-11-08 16:52:25,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:25,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:52:25,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:25,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:52:25,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:25,612 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:25,630 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2024-11-08 16:52:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:52:25,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 16:52:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:25,632 INFO L225 Difference]: With dead ends: 53 [2024-11-08 16:52:25,632 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 16:52:25,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:25,635 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:25,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:52:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 16:52:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-08 16:52:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:52:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-08 16:52:25,645 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 15 [2024-11-08 16:52:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:25,645 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-08 16:52:25,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-08 16:52:25,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 16:52:25,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:25,647 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:25,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:52:25,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:25,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:25,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1030095042, now seen corresponding path program 1 times [2024-11-08 16:52:25,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:25,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309797002] [2024-11-08 16:52:25,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:25,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:25,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:25,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309797002] [2024-11-08 16:52:25,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309797002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:52:25,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617056369] [2024-11-08 16:52:25,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:25,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:25,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:52:25,781 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:52:25,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:52:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:25,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:52:25,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:25,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:26,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:26,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617056369] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:52:26,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:52:26,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-11-08 16:52:26,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214624672] [2024-11-08 16:52:26,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:26,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:52:26,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:26,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:52:26,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:52:26,009 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:26,054 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2024-11-08 16:52:26,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:52:26,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-08 16:52:26,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:26,055 INFO L225 Difference]: With dead ends: 57 [2024-11-08 16:52:26,055 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 16:52:26,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:52:26,056 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:26,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:52:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 16:52:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-08 16:52:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:52:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-08 16:52:26,061 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 17 [2024-11-08 16:52:26,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:26,061 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-08 16:52:26,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-08 16:52:26,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 16:52:26,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:26,062 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:26,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 16:52:26,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:26,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:26,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:26,268 INFO L85 PathProgramCache]: Analyzing trace with hash -626365316, now seen corresponding path program 2 times [2024-11-08 16:52:26,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:26,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143643073] [2024-11-08 16:52:26,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:26,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:26,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:52:26,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143643073] [2024-11-08 16:52:26,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143643073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:52:26,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834474990] [2024-11-08 16:52:26,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 16:52:26,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:26,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:52:26,402 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:52:26,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:52:26,447 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 16:52:26,447 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:52:26,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 16:52:26,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:26,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:26,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834474990] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:52:26,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:52:26,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-08 16:52:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959113941] [2024-11-08 16:52:26,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:26,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 16:52:26,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:52:26,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 16:52:26,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:52:26,580 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:26,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:26,666 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2024-11-08 16:52:26,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:52:26,667 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-08 16:52:26,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:26,668 INFO L225 Difference]: With dead ends: 65 [2024-11-08 16:52:26,668 INFO L226 Difference]: Without dead ends: 50 [2024-11-08 16:52:26,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:52:26,669 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:26,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 285 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:52:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-08 16:52:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-08 16:52:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:52:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-08 16:52:26,675 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 21 [2024-11-08 16:52:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:26,675 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-08 16:52:26,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-08 16:52:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 16:52:26,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:26,676 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:26,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 16:52:26,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:52:26,877 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:26,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2101905688, now seen corresponding path program 1 times [2024-11-08 16:52:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:52:26,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121086676] [2024-11-08 16:52:26,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:52:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:52:26,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:52:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:52:26,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:52:26,902 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:52:26,902 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-08 16:52:26,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-08 16:52:26,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:52:26,906 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-11-08 16:52:26,919 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:52:26,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:52:26 BoogieIcfgContainer [2024-11-08 16:52:26,921 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:52:26,921 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:52:26,921 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:52:26,922 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:52:26,922 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:52:24" (3/4) ... [2024-11-08 16:52:26,924 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:52:26,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:52:26,925 INFO L158 Benchmark]: Toolchain (without parser) took 2601.16ms. Allocated memory is still 180.4MB. Free memory was 111.0MB in the beginning and 83.0MB in the end (delta: 28.0MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-11-08 16:52:26,925 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 180.4MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:52:26,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.99ms. Allocated memory is still 180.4MB. Free memory was 110.8MB in the beginning and 151.4MB in the end (delta: -40.6MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-08 16:52:26,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.76ms. Allocated memory is still 180.4MB. Free memory was 151.4MB in the beginning and 150.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:52:26,926 INFO L158 Benchmark]: Boogie Preprocessor took 32.99ms. Allocated memory is still 180.4MB. Free memory was 150.2MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:52:26,926 INFO L158 Benchmark]: RCFGBuilder took 283.88ms. Allocated memory is still 180.4MB. Free memory was 148.1MB in the beginning and 133.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 16:52:26,926 INFO L158 Benchmark]: TraceAbstraction took 1936.51ms. Allocated memory is still 180.4MB. Free memory was 132.6MB in the beginning and 84.1MB in the end (delta: 48.5MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2024-11-08 16:52:26,927 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 180.4MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:52:26,928 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 180.4MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.99ms. Allocated memory is still 180.4MB. Free memory was 110.8MB in the beginning and 151.4MB in the end (delta: -40.6MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.76ms. Allocated memory is still 180.4MB. Free memory was 151.4MB in the beginning and 150.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.99ms. Allocated memory is still 180.4MB. Free memory was 150.2MB in the beginning and 148.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 283.88ms. Allocated memory is still 180.4MB. Free memory was 148.1MB in the beginning and 133.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1936.51ms. Allocated memory is still 180.4MB. Free memory was 132.6MB in the beginning and 84.1MB in the end (delta: 48.5MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 180.4MB. Free memory was 84.1MB in the beginning and 83.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 109]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 102. Possible FailurePath: [L115] COND FALSE !(__VERIFIER_nondet_int()) [L118] CALL main2() [L97] float IN = __VERIFIER_nondet_float(); [L98] CALL assume_abort_if_not(IN > -1.4f && IN < 1.4f) [L82] COND FALSE !(!cond) [L98] RET assume_abort_if_not(IN > -1.4f && IN < 1.4f) [L100] CALL, EXPR f(IN) VAL [\old(x)=111] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=111] [L100] RET, EXPR f(IN) VAL [IN=111] [L100] CALL, EXPR fp(IN) VAL [\old(x)=111] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=111] [L100] RET, EXPR fp(IN) VAL [IN=111] [L100] float x = IN - f(IN)/fp(IN); [L102] CALL, EXPR f(x) VAL [\old(x)=110] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=110] [L102] RET, EXPR f(x) VAL [IN=111, x=110] [L102] CALL, EXPR fp(x) VAL [\old(x)=110] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=110] [L102] RET, EXPR fp(x) VAL [IN=111, x=110] [L102] x = x - f(x)/fp(x) [L108] COND TRUE !(x < 0.1) VAL [IN=111] [L109] reach_error() VAL [IN=111] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 636 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 447 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 189 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 513 SizeOfPredicates, 5 NumberOfNonLiveVariables, 168 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 29/61 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 16:52:26,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_4+newton_2_7.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5365e3b9adf0a1dadb935cfdb4266af37826f3120fbeff3f7ce577b21fb856a6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:52:29,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:52:29,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:52:29,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:52:29,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:52:29,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:52:29,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:52:29,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:52:29,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:52:29,170 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:52:29,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:52:29,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:52:29,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:52:29,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:52:29,172 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:52:29,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:52:29,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:52:29,176 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:52:29,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:52:29,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:52:29,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:52:29,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:52:29,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:52:29,177 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:52:29,177 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:52:29,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:52:29,177 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:52:29,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:52:29,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:52:29,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:52:29,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:52:29,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:52:29,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:52:29,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:52:29,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:52:29,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:52:29,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:52:29,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:52:29,182 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 16:52:29,182 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:52:29,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:52:29,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:52:29,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:52:29,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:52:29,183 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5365e3b9adf0a1dadb935cfdb4266af37826f3120fbeff3f7ce577b21fb856a6 [2024-11-08 16:52:29,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:52:29,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:52:29,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:52:29,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:52:29,478 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:52:29,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_2_7.i [2024-11-08 16:52:30,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:52:31,067 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:52:31,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_7.i [2024-11-08 16:52:31,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990ecb896/5c2fec4ba0f045f7b54178fd16ea2b4d/FLAG2f952e76d [2024-11-08 16:52:31,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990ecb896/5c2fec4ba0f045f7b54178fd16ea2b4d [2024-11-08 16:52:31,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:52:31,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:52:31,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:52:31,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:52:31,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:52:31,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3efa5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31, skipping insertion in model container [2024-11-08 16:52:31,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:52:31,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_7.i[1224,1237] [2024-11-08 16:52:31,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_7.i[2827,2840] [2024-11-08 16:52:31,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:52:31,276 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:52:31,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_7.i[1224,1237] [2024-11-08 16:52:31,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_7.i[2827,2840] [2024-11-08 16:52:31,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:52:31,309 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:52:31,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31 WrapperNode [2024-11-08 16:52:31,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:52:31,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:52:31,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:52:31,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:52:31,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,337 INFO L138 Inliner]: procedures = 28, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 76 [2024-11-08 16:52:31,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:52:31,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:52:31,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:52:31,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:52:31,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,363 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-08 16:52:31,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:52:31,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:52:31,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:52:31,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:52:31,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (1/1) ... [2024-11-08 16:52:31,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:52:31,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:52:31,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:52:31,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:52:31,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:52:31,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:52:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 16:52:31,506 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-08 16:52:31,507 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-08 16:52:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-08 16:52:31,507 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-08 16:52:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:52:31,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:52:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 16:52:31,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 16:52:31,587 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:52:31,590 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:52:43,187 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 16:52:43,188 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:52:43,196 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:52:43,196 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:52:43,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:52:43 BoogieIcfgContainer [2024-11-08 16:52:43,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:52:43,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:52:43,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:52:43,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:52:43,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:52:31" (1/3) ... [2024-11-08 16:52:43,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7fcbda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:52:43, skipping insertion in model container [2024-11-08 16:52:43,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:52:31" (2/3) ... [2024-11-08 16:52:43,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7fcbda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:52:43, skipping insertion in model container [2024-11-08 16:52:43,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:52:43" (3/3) ... [2024-11-08 16:52:43,202 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_7.i [2024-11-08 16:52:43,213 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:52:43,213 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 16:52:43,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:52:43,264 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7308310, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:52:43,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 16:52:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 32 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 16:52:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 16:52:43,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:43,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:43,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:43,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:43,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1780479560, now seen corresponding path program 1 times [2024-11-08 16:52:43,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:52:43,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298884950] [2024-11-08 16:52:43,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:43,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:43,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:52:43,297 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:43,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 16:52:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:43,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:52:43,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:43,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:43,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:52:43,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298884950] [2024-11-08 16:52:43,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298884950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:43,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:43,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:52:43,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165589669] [2024-11-08 16:52:43,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:43,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:52:43,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:52:43,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:52:43,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:43,551 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 32 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:43,676 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2024-11-08 16:52:43,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:52:43,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 16:52:43,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:43,684 INFO L225 Difference]: With dead ends: 84 [2024-11-08 16:52:43,685 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 16:52:43,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:43,691 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:43,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:52:43,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 16:52:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-08 16:52:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:52:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-08 16:52:43,722 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2024-11-08 16:52:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:43,723 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-08 16:52:43,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-08 16:52:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 16:52:43,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:43,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:43,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 16:52:43,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:43,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:43,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:43,931 INFO L85 PathProgramCache]: Analyzing trace with hash 413626440, now seen corresponding path program 1 times [2024-11-08 16:52:43,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:52:43,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758164212] [2024-11-08 16:52:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:43,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:43,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:52:43,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:43,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 16:52:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:43,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:52:43,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:44,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:44,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:52:44,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758164212] [2024-11-08 16:52:44,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758164212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:44,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:44,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:52:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982262943] [2024-11-08 16:52:44,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:44,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:52:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:52:44,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:52:44,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:44,078 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:44,189 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2024-11-08 16:52:44,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:52:44,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 16:52:44,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:44,191 INFO L225 Difference]: With dead ends: 52 [2024-11-08 16:52:44,191 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 16:52:44,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:44,192 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:44,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:52:44,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 16:52:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 16:52:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:52:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-08 16:52:44,199 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 13 [2024-11-08 16:52:44,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:44,199 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-08 16:52:44,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-08 16:52:44,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 16:52:44,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:44,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:44,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 16:52:44,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:44,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:44,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1715037691, now seen corresponding path program 1 times [2024-11-08 16:52:44,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:52:44,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136621110] [2024-11-08 16:52:44,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:44,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:52:44,409 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:44,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 16:52:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:44,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 16:52:44,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:44,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:52:44,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:52:44,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136621110] [2024-11-08 16:52:44,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136621110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:52:44,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:52:44,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:52:44,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996339934] [2024-11-08 16:52:44,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:52:44,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:52:44,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:52:44,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:52:44,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:44,835 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:44,968 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2024-11-08 16:52:44,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:52:44,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 16:52:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:44,969 INFO L225 Difference]: With dead ends: 53 [2024-11-08 16:52:44,969 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 16:52:44,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:52:44,970 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:44,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:52:44,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 16:52:44,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-08 16:52:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:52:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-08 16:52:44,975 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 15 [2024-11-08 16:52:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:44,975 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-08 16:52:44,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-08 16:52:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 16:52:44,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:44,976 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:44,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 16:52:45,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:45,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:45,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:45,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1030095042, now seen corresponding path program 1 times [2024-11-08 16:52:45,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:52:45,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961997523] [2024-11-08 16:52:45,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:52:45,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:45,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:52:45,182 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:45,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 16:52:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:52:45,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 16:52:45,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:45,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:52:45,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:52:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961997523] [2024-11-08 16:52:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961997523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:52:45,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:52:45,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-08 16:52:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179273404] [2024-11-08 16:52:45,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:45,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:52:45,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:52:45,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:52:45,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:52:45,954 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:46,291 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2024-11-08 16:52:46,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:52:46,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-08 16:52:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:46,292 INFO L225 Difference]: With dead ends: 57 [2024-11-08 16:52:46,292 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 16:52:46,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:52:46,293 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:46,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:52:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 16:52:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-08 16:52:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 16:52:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-08 16:52:46,298 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 17 [2024-11-08 16:52:46,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:46,299 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-08 16:52:46,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-08 16:52:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 16:52:46,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:46,300 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:46,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 16:52:46,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:46,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:52:46,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:52:46,504 INFO L85 PathProgramCache]: Analyzing trace with hash -626365316, now seen corresponding path program 2 times [2024-11-08 16:52:46,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:52:46,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263349360] [2024-11-08 16:52:46,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 16:52:46,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:52:46,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:52:46,507 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:52:46,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 16:52:46,561 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 16:52:46,561 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:52:46,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 16:52:46,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:52:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:52:48,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:52:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:52:54,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 16:52:54,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263349360] [2024-11-08 16:52:54,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263349360] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:52:54,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:52:54,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-08 16:52:54,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531265032] [2024-11-08 16:52:54,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:52:54,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 16:52:54,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 16:52:54,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 16:52:54,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-08 16:52:54,764 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:59,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:52:59,883 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2024-11-08 16:52:59,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:52:59,889 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-08 16:52:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:52:59,891 INFO L225 Difference]: With dead ends: 68 [2024-11-08 16:52:59,891 INFO L226 Difference]: Without dead ends: 65 [2024-11-08 16:52:59,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-11-08 16:52:59,893 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:52:59,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 390 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-08 16:52:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-08 16:52:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-08 16:52:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 51 states have internal predecessors, (58), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 16:52:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2024-11-08 16:52:59,905 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 21 [2024-11-08 16:52:59,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:52:59,905 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2024-11-08 16:52:59,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:52:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2024-11-08 16:52:59,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 16:52:59,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:52:59,907 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:52:59,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 16:53:00,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:00,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:53:00,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2101905688, now seen corresponding path program 1 times [2024-11-08 16:53:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 16:53:00,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677591575] [2024-11-08 16:53:00,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:00,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 16:53:00,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 16:53:00,113 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 16:53:00,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 16:53:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:53:56,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.