./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:54:07,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:54:07,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:54:07,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:54:07,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:54:07,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:54:07,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:54:07,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:54:07,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:54:07,450 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:54:07,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:54:07,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:54:07,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:54:07,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:54:07,451 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:54:07,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:54:07,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:54:07,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:54:07,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:54:07,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:54:07,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:54:07,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:54:07,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:54:07,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:54:07,456 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:54:07,456 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:54:07,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:54:07,456 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:54:07,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:54:07,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:54:07,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:54:07,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:54:07,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:54:07,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:54:07,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:54:07,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:54:07,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:54:07,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:54:07,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:54:07,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:54:07,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:54:07,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:54:07,461 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-clean/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-clean/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 -> 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 [2024-10-11 10:54:07,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:54:07,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:54:07,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:54:07,715 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:54:07,716 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:54:07,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2024-10-11 10:54:09,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:54:09,294 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:54:09,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2024-10-11 10:54:09,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4cb8f0124/370187f9787b452d84ed848ef24c93fa/FLAG291267ba6 [2024-10-11 10:54:09,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4cb8f0124/370187f9787b452d84ed848ef24c93fa [2024-10-11 10:54:09,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:54:09,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:54:09,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:54:09,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:54:09,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:54:09,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:54:09" (1/1) ... [2024-10-11 10:54:09,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30da3fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:09, skipping insertion in model container [2024-10-11 10:54:09,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:54:09" (1/1) ... [2024-10-11 10:54:09,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:54:09,919 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i[916,929] [2024-10-11 10:54:09,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:54:09,973 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:54:09,982 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i[916,929] [2024-10-11 10:54:09,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:54:10,014 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:54:10,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10 WrapperNode [2024-10-11 10:54:10,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:54:10,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:54:10,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:54:10,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:54:10,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10" (1/1) ... [2024-10-11 10:54:10,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10" (1/1) ... [2024-10-11 10:54:10,057 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-10-11 10:54:10,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:54:10,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:54:10,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:54:10,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:54:10,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10" (1/1) ... [2024-10-11 10:54:10,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10" (1/1) ... [2024-10-11 10:54:10,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10" (1/1) ... [2024-10-11 10:54:10,093 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:54:10,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10" (1/1) ... [2024-10-11 10:54:10,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10" (1/1) ... [2024-10-11 10:54:10,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10" (1/1) ... [2024-10-11 10:54:10,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10" (1/1) ... [2024-10-11 10:54:10,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10" (1/1) ... [2024-10-11 10:54:10,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10" (1/1) ... [2024-10-11 10:54:10,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:54:10,122 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:54:10,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:54:10,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:54:10,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10" (1/1) ... [2024-10-11 10:54:10,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:54:10,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:54:10,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:54:10,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:54:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:54:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:54:10,210 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:54:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:54:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:54:10,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:54:10,282 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:54:10,284 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:54:10,525 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:54:10,527 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:54:10,565 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:54:10,566 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:54:10,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:54:10 BoogieIcfgContainer [2024-10-11 10:54:10,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:54:10,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:54:10,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:54:10,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:54:10,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:54:09" (1/3) ... [2024-10-11 10:54:10,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f83967e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:54:10, skipping insertion in model container [2024-10-11 10:54:10,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:10" (2/3) ... [2024-10-11 10:54:10,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f83967e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:54:10, skipping insertion in model container [2024-10-11 10:54:10,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:54:10" (3/3) ... [2024-10-11 10:54:10,575 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-25.i [2024-10-11 10:54:10,590 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:54:10,590 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:54:10,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:54:10,645 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;@4493420e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:54:10,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:54:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:54:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 10:54:10,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:54:10,658 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:54:10,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:54:10,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:54:10,663 INFO L85 PathProgramCache]: Analyzing trace with hash 437782606, now seen corresponding path program 1 times [2024-10-11 10:54:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:54:10,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626231822] [2024-10-11 10:54:10,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:54:10,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:54:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:10,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:54:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:10,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:54:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:10,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:54:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:10,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:54:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:10,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:54:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:10,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:54:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:10,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:54:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:10,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:54:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:10,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:54:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:10,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:54:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:10,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:54:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:10,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:54:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:54:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:54:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:54:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:54:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:54:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:54:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:54:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:54:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 10:54:11,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:54:11,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626231822] [2024-10-11 10:54:11,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626231822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:54:11,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:54:11,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:54:11,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208098631] [2024-10-11 10:54:11,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:54:11,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:54:11,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:54:11,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:54:11,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:54:11,089 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:54:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:54:11,132 INFO L93 Difference]: Finished difference Result 101 states and 180 transitions. [2024-10-11 10:54:11,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:54:11,135 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2024-10-11 10:54:11,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:54:11,142 INFO L225 Difference]: With dead ends: 101 [2024-10-11 10:54:11,143 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 10:54:11,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:54:11,150 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:54:11,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:54:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 10:54:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 10:54:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:54:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2024-10-11 10:54:11,189 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 121 [2024-10-11 10:54:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:54:11,190 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2024-10-11 10:54:11,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:54:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2024-10-11 10:54:11,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 10:54:11,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:54:11,194 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:54:11,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:54:11,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:54:11,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:54:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash 479436878, now seen corresponding path program 1 times [2024-10-11 10:54:11,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:54:11,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543053331] [2024-10-11 10:54:11,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:54:11,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:54:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:54:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:54:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:54:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:54:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:54:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:54:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:54:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:54:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:54:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:54:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:54:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:54:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:54:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:54:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 10:54:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:54:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 10:54:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:54:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 10:54:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:54:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 10:54:11,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:54:11,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543053331] [2024-10-11 10:54:11,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543053331] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:54:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96737246] [2024-10-11 10:54:11,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:54:11,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:54:11,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:54:11,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:54:11,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:54:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:11,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 10:54:12,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:54:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-11 10:54:12,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:54:12,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96737246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:54:12,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 10:54:12,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-10-11 10:54:12,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204045839] [2024-10-11 10:54:12,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:54:12,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:54:12,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:54:12,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:54:12,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:54:12,178 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:54:12,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:54:12,555 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2024-10-11 10:54:12,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 10:54:12,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2024-10-11 10:54:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:54:12,561 INFO L225 Difference]: With dead ends: 109 [2024-10-11 10:54:12,561 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 10:54:12,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2024-10-11 10:54:12,564 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 100 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:54:12,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 125 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:54:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 10:54:12,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-10-11 10:54:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:54:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2024-10-11 10:54:12,585 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 121 [2024-10-11 10:54:12,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:54:12,585 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2024-10-11 10:54:12,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:54:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2024-10-11 10:54:12,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 10:54:12,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:54:12,589 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:54:12,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 10:54:12,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:54:12,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:54:12,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:54:12,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1091332821, now seen corresponding path program 1 times [2024-10-11 10:54:12,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:54:12,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772655017] [2024-10-11 10:54:12,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:54:12,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:54:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:54:12,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:54:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:54:12,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:54:12,983 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:54:12,985 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:54:12,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:54:12,993 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 10:54:13,070 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:54:13,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:54:13 BoogieIcfgContainer [2024-10-11 10:54:13,072 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:54:13,073 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:54:13,073 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:54:13,073 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:54:13,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:54:10" (3/4) ... [2024-10-11 10:54:13,076 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:54:13,077 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:54:13,077 INFO L158 Benchmark]: Toolchain (without parser) took 3398.91ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 104.6MB in the beginning and 55.8MB in the end (delta: 48.9MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2024-10-11 10:54:13,077 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:54:13,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.56ms. Allocated memory is still 163.6MB. Free memory was 104.6MB in the beginning and 129.6MB in the end (delta: -25.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 10:54:13,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.33ms. Allocated memory is still 163.6MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:54:13,078 INFO L158 Benchmark]: Boogie Preprocessor took 62.34ms. Allocated memory is still 163.6MB. Free memory was 127.5MB in the beginning and 124.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:54:13,078 INFO L158 Benchmark]: RCFGBuilder took 444.93ms. Allocated memory is still 163.6MB. Free memory was 124.2MB in the beginning and 105.1MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 10:54:13,079 INFO L158 Benchmark]: TraceAbstraction took 2502.80ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 103.9MB in the beginning and 55.8MB in the end (delta: 48.1MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2024-10-11 10:54:13,079 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 197.1MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:54:13,080 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.15ms. Allocated memory is still 96.5MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.56ms. Allocated memory is still 163.6MB. Free memory was 104.6MB in the beginning and 129.6MB in the end (delta: -25.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.33ms. Allocated memory is still 163.6MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.34ms. Allocated memory is still 163.6MB. Free memory was 127.5MB in the beginning and 124.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 444.93ms. Allocated memory is still 163.6MB. Free memory was 124.2MB in the beginning and 105.1MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2502.80ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 103.9MB in the beginning and 55.8MB in the end (delta: 48.1MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 197.1MB. Free memory is still 55.8MB. 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: 19]: 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 to_int at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 256; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 10; [L25] unsigned short int var_1_4 = 500; [L26] unsigned long int var_1_5 = 0; [L27] unsigned long int var_1_6 = 1509114200; [L28] unsigned long int var_1_7 = 10; [L29] signed long int var_1_8 = 128; [L30] signed long int var_1_9 = 63; [L31] signed long int var_1_10 = 4; [L32] signed long int var_1_11 = 25; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] FCALL updateLastVariables() [L113] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L74] var_1_3 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L75] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L76] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L76] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L77] var_1_4 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L79] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L79] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L80] var_1_5 = __VERIFIER_nondet_ulong() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L82] CALL assume_abort_if_not(var_1_5 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L82] RET assume_abort_if_not(var_1_5 <= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=128, var_1_9=63] [L83] var_1_6 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=10, var_1_8=128, var_1_9=63] [L84] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=10, var_1_8=128, var_1_9=63] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=10, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=10, var_1_8=128, var_1_9=63] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=10, var_1_8=128, var_1_9=63] [L86] var_1_7 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_8=128, var_1_9=63] [L87] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_8=128, var_1_9=63] [L88] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=63] [L88] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=63] [L89] var_1_9 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L90] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L91] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L91] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L92] var_1_10 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L93] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L94] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L94] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L95] var_1_13 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L96] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L97] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L97] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L98] var_1_14 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L99] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L100] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L100] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L113] RET updateVariables() [L114] CALL step() [L39] COND FALSE !(var_1_9 != var_1_10) [L46] var_1_12 = var_1_14 VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L48] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=65536, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=65536, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L49] COND TRUE \read(var_1_12) VAL [isInitial=1, stepLocal_0=65536, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=0, var_1_3=65536, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L50] COND TRUE stepLocal_0 <= var_1_4 [L51] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=-3758096385, var_1_2=0, var_1_3=65536, var_1_4=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L56] unsigned long int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_1=-3758096385, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=-3758096385, var_1_2=0, var_1_3=65536, var_1_4=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=128, var_1_9=-1] [L57] COND TRUE var_1_7 >= stepLocal_1 [L58] var_1_8 = ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))) VAL [isInitial=1, var_1_10=-1, var_1_11=25, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=-3758096385, var_1_2=0, var_1_3=65536, var_1_4=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_9=-1] [L62] COND TRUE var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8))) [L63] var_1_11 = var_1_10 VAL [isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=-3758096385, var_1_2=0, var_1_3=65536, var_1_4=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_9=-1] [L114] RET step() [L115] CALL, EXPR property() [L105-L106] return (((var_1_12 ? ((var_1_3 <= var_1_4) ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)))) : 1) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_7 >= var_1_1) ? (var_1_8 == ((signed long int) ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))))) : (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))))) && ((var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8)))) ? (var_1_11 == ((signed long int) var_1_10)) : ((! (var_1_7 <= var_1_6)) ? (var_1_11 == ((signed long int) var_1_9)) : 1))) && ((var_1_9 != var_1_10) ? ((var_1_2 || var_1_13) ? (var_1_12 == ((unsigned char) (var_1_13 || var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=-3758096385, var_1_2=0, var_1_3=65536, var_1_4=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=1509114202, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, var_1_10=-1, var_1_11=-1, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=-3758096385, var_1_2=0, var_1_3=65536, var_1_4=0, var_1_5=0, var_1_6=-11811160065, var_1_7=-8053063680, var_1_8=1509114202, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 165 IncrementalHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 119 mSDtfsCounter, 165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 485 NumberOfCodeBlocks, 485 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 590 SizeOfPredicates, 2 NumberOfNonLiveVariables, 267 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2277/2280 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-10-11 10:54:13,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:54:15,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:54:15,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:54:15,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:54:15,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:54:15,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:54:15,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:54:15,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:54:15,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:54:15,207 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:54:15,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:54:15,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:54:15,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:54:15,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:54:15,209 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:54:15,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:54:15,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:54:15,210 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:54:15,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:54:15,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:54:15,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:54:15,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:54:15,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:54:15,212 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:54:15,212 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:54:15,212 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:54:15,212 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:54:15,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:54:15,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:54:15,213 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:54:15,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:54:15,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:54:15,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:54:15,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:54:15,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:54:15,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:54:15,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:54:15,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:54:15,218 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:54:15,218 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:54:15,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:54:15,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:54:15,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:54:15,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:54:15,219 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:54:15,219 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-clean/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-clean/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 -> 10a5d9ba28fc165cfaae4fdbd64ca86f9d1271dd94f7e86756ae9bbf811b41f0 [2024-10-11 10:54:15,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:54:15,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:54:15,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:54:15,526 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:54:15,526 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:54:15,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2024-10-11 10:54:16,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:54:17,105 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:54:17,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i [2024-10-11 10:54:17,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5c2c43330/e79d542ef5a84977a1ec26b10cba9a90/FLAG01136e323 [2024-10-11 10:54:17,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5c2c43330/e79d542ef5a84977a1ec26b10cba9a90 [2024-10-11 10:54:17,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:54:17,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:54:17,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:54:17,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:54:17,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:54:17,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14297d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17, skipping insertion in model container [2024-10-11 10:54:17,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:54:17,709 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i[916,929] [2024-10-11 10:54:17,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:54:17,779 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:54:17,788 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-25.i[916,929] [2024-10-11 10:54:17,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:54:17,831 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:54:17,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17 WrapperNode [2024-10-11 10:54:17,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:54:17,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:54:17,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:54:17,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:54:17,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,868 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-11 10:54:17,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:54:17,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:54:17,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:54:17,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:54:17,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,902 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:54:17,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:54:17,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:54:17,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:54:17,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:54:17,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17" (1/1) ... [2024-10-11 10:54:17,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:54:17,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:54:17,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:54:17,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:54:18,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:54:18,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:54:18,020 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:54:18,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:54:18,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:54:18,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:54:18,093 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:54:18,095 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:54:21,228 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:54:21,228 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:54:21,269 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:54:21,269 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:54:21,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:54:21 BoogieIcfgContainer [2024-10-11 10:54:21,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:54:21,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:54:21,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:54:21,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:54:21,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:54:17" (1/3) ... [2024-10-11 10:54:21,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdfbd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:54:21, skipping insertion in model container [2024-10-11 10:54:21,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:54:17" (2/3) ... [2024-10-11 10:54:21,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdfbd67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:54:21, skipping insertion in model container [2024-10-11 10:54:21,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:54:21" (3/3) ... [2024-10-11 10:54:21,276 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-25.i [2024-10-11 10:54:21,291 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:54:21,291 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:54:21,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:54:21,358 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;@a942b0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:54:21,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:54:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:54:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 10:54:21,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:54:21,376 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:54:21,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:54:21,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:54:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash 437782606, now seen corresponding path program 1 times [2024-10-11 10:54:21,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:54:21,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658322341] [2024-10-11 10:54:21,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:54:21,397 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-10-11 10:54:21,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:54:21,401 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 10:54:21,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:54:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:21,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:54:21,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:54:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-10-11 10:54:21,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:54:21,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:54:21,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658322341] [2024-10-11 10:54:21,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658322341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:54:21,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:54:21,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:54:21,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377298115] [2024-10-11 10:54:21,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:54:21,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:54:21,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:54:21,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:54:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:54:21,664 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:54:22,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:54:22,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:54:22,803 INFO L93 Difference]: Finished difference Result 101 states and 180 transitions. [2024-10-11 10:54:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:54:22,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-11 10:54:22,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:54:22,832 INFO L225 Difference]: With dead ends: 101 [2024-10-11 10:54:22,833 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 10:54:22,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:54:22,838 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:54:22,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 10:54:22,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 10:54:22,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 10:54:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:54:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2024-10-11 10:54:22,882 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 121 [2024-10-11 10:54:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:54:22,884 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2024-10-11 10:54:22,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 10:54:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2024-10-11 10:54:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 10:54:22,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:54:22,890 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:54:22,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:54:23,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 10:54:23,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:54:23,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:54:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash 479436878, now seen corresponding path program 1 times [2024-10-11 10:54:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:54:23,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256560050] [2024-10-11 10:54:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:54:23,095 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-10-11 10:54:23,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:54:23,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 10:54:23,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:54:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:23,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 10:54:23,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:54:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-11 10:54:23,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:54:23,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:54:23,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256560050] [2024-10-11 10:54:23,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256560050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:54:23,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:54:23,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:54:23,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231018538] [2024-10-11 10:54:23,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:54:23,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:54:23,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:54:23,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:54:23,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:54:23,606 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:54:25,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:54:25,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:54:25,534 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2024-10-11 10:54:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 10:54:25,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2024-10-11 10:54:25,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:54:25,552 INFO L225 Difference]: With dead ends: 109 [2024-10-11 10:54:25,552 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 10:54:25,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2024-10-11 10:54:25,554 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 72 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 10:54:25,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 128 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 10:54:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 10:54:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-10-11 10:54:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 10:54:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 81 transitions. [2024-10-11 10:54:25,566 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 81 transitions. Word has length 121 [2024-10-11 10:54:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:54:25,567 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 81 transitions. [2024-10-11 10:54:25,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 10:54:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 81 transitions. [2024-10-11 10:54:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 10:54:25,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:54:25,568 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:54:25,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 10:54:25,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 10:54:25,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:54:25,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:54:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1091332821, now seen corresponding path program 1 times [2024-10-11 10:54:25,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:54:25,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839001306] [2024-10-11 10:54:25,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:54:25,771 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-10-11 10:54:25,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:54:25,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 10:54:25,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 10:54:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:54:25,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:54:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:54:25,998 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-11 10:54:25,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [288712658] [2024-10-11 10:54:25,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:54:25,999 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 10:54:25,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 10:54:26,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 10:54:26,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-11 10:54:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:54:26,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 10:54:26,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:55:36,861 WARN L286 SmtUtils]: Spent 12.64s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)