./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_has-floats_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-57.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bbe68fb90de4f0709fb0afd99ee912b5cc4ae214f3f64ef6d7261966d1843e3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:28:06,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:28:07,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:28:07,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:28:07,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:28:07,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:28:07,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:28:07,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:28:07,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:28:07,050 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:28:07,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:28:07,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:28:07,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:28:07,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:28:07,053 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:28:07,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:28:07,054 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:28:07,054 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:28:07,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:28:07,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:28:07,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:28:07,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:28:07,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:28:07,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:28:07,060 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:28:07,060 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:28:07,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:28:07,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:28:07,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:28:07,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:28:07,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:28:07,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:28:07,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:28:07,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:28:07,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:28:07,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:28:07,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:28:07,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:28:07,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:28:07,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:28:07,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:28:07,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:28:07,066 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bbe68fb90de4f0709fb0afd99ee912b5cc4ae214f3f64ef6d7261966d1843e3 [2024-10-13 03:28:07,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:28:07,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:28:07,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:28:07,375 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:28:07,376 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:28:07,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-57.i [2024-10-13 03:28:08,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:28:09,007 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:28:09,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-57.i [2024-10-13 03:28:09,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/075942fc8/6b8d7202bf474cba9d74b92d2dd3a135/FLAG63c682a8a [2024-10-13 03:28:09,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/075942fc8/6b8d7202bf474cba9d74b92d2dd3a135 [2024-10-13 03:28:09,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:28:09,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:28:09,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:28:09,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:28:09,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:28:09,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f356c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09, skipping insertion in model container [2024-10-13 03:28:09,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:28:09,252 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_has-floats_file-57.i[917,930] [2024-10-13 03:28:09,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:28:09,323 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:28:09,334 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_has-floats_file-57.i[917,930] [2024-10-13 03:28:09,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:28:09,379 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:28:09,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09 WrapperNode [2024-10-13 03:28:09,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:28:09,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:28:09,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:28:09,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:28:09,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,430 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-10-13 03:28:09,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:28:09,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:28:09,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:28:09,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:28:09,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,457 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-13 03:28:09,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:28:09,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:28:09,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:28:09,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:28:09,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09" (1/1) ... [2024-10-13 03:28:09,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:28:09,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:28:09,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:28:09,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:28:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:28:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:28:09,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:28:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:28:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:28:09,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:28:09,657 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:28:09,659 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:28:09,992 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 03:28:09,994 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:28:10,076 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:28:10,078 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:28:10,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:28:10 BoogieIcfgContainer [2024-10-13 03:28:10,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:28:10,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:28:10,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:28:10,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:28:10,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:28:09" (1/3) ... [2024-10-13 03:28:10,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10cb137b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:28:10, skipping insertion in model container [2024-10-13 03:28:10,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:09" (2/3) ... [2024-10-13 03:28:10,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10cb137b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:28:10, skipping insertion in model container [2024-10-13 03:28:10,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:28:10" (3/3) ... [2024-10-13 03:28:10,091 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-57.i [2024-10-13 03:28:10,106 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:28:10,106 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:28:10,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:28:10,170 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;@4c1d01e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:28:10,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:28:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:28:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 03:28:10,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:10,184 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 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-13 03:28:10,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:10,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:10,189 INFO L85 PathProgramCache]: Analyzing trace with hash -669129977, now seen corresponding path program 1 times [2024-10-13 03:28:10,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:28:10,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589759236] [2024-10-13 03:28:10,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:10,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:28:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:28:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:28:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:28:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:28:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:28:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:28:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:28:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:28:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:28:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:28:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:28:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:28:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:28:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:28:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:28:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:28:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:28:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:28:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 03:28:10,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:28:10,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589759236] [2024-10-13 03:28:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589759236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:10,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:10,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:28:10,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369306576] [2024-10-13 03:28:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:10,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:28:10,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:28:10,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:28:10,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:28:10,591 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 03:28:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:10,637 INFO L93 Difference]: Finished difference Result 91 states and 160 transitions. [2024-10-13 03:28:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:28:10,642 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 109 [2024-10-13 03:28:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:10,655 INFO L225 Difference]: With dead ends: 91 [2024-10-13 03:28:10,655 INFO L226 Difference]: Without dead ends: 45 [2024-10-13 03:28:10,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-13 03:28:10,662 INFO L432 NwaCegarLoop]: 64 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, 64 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-13 03:28:10,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:28:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-13 03:28:10,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-13 03:28:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:28:10,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2024-10-13 03:28:10,718 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 109 [2024-10-13 03:28:10,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:10,719 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-13 03:28:10,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 03:28:10,720 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2024-10-13 03:28:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 03:28:10,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:10,723 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 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-13 03:28:10,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:28:10,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:10,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:10,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1043084857, now seen corresponding path program 1 times [2024-10-13 03:28:10,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:28:10,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698965092] [2024-10-13 03:28:10,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:10,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:28:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:28:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:28:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:28:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:28:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:28:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:28:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:28:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:28:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:28:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:28:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:28:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:28:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:28:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:28:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:28:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:28:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:28:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:28:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 03:28:11,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:28:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698965092] [2024-10-13 03:28:11,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698965092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:11,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:11,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:28:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187955547] [2024-10-13 03:28:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:11,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:28:11,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:28:11,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:28:11,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:28:11,216 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 03:28:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:11,462 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2024-10-13 03:28:11,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:28:11,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2024-10-13 03:28:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:11,465 INFO L225 Difference]: With dead ends: 134 [2024-10-13 03:28:11,465 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 03:28:11,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:28:11,467 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 36 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:28:11,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 180 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:28:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 03:28:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-10-13 03:28:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 03:28:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 117 transitions. [2024-10-13 03:28:11,505 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 117 transitions. Word has length 109 [2024-10-13 03:28:11,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:11,505 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 117 transitions. [2024-10-13 03:28:11,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 03:28:11,506 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 117 transitions. [2024-10-13 03:28:11,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 03:28:11,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:11,508 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 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-13 03:28:11,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:28:11,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:11,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:11,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1494859976, now seen corresponding path program 1 times [2024-10-13 03:28:11,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:28:11,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756617973] [2024-10-13 03:28:11,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:28:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:28:11,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:28:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:28:11,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:28:11,723 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:28:11,724 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:28:11,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:28:11,729 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 03:28:11,827 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:28:11,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:28:11 BoogieIcfgContainer [2024-10-13 03:28:11,833 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:28:11,833 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:28:11,833 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:28:11,834 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:28:11,834 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:28:10" (3/4) ... [2024-10-13 03:28:11,837 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:28:11,838 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:28:11,838 INFO L158 Benchmark]: Toolchain (without parser) took 2804.92ms. Allocated memory is still 182.5MB. Free memory was 113.6MB in the beginning and 118.2MB in the end (delta: -4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:28:11,839 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:28:11,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.49ms. Allocated memory is still 182.5MB. Free memory was 113.3MB in the beginning and 99.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 03:28:11,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.92ms. Allocated memory is still 182.5MB. Free memory was 99.4MB in the beginning and 97.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:28:11,843 INFO L158 Benchmark]: Boogie Preprocessor took 49.66ms. Allocated memory is still 182.5MB. Free memory was 97.2MB in the beginning and 94.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:28:11,843 INFO L158 Benchmark]: RCFGBuilder took 599.92ms. Allocated memory is still 182.5MB. Free memory was 94.8MB in the beginning and 148.9MB in the end (delta: -54.1MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-10-13 03:28:11,844 INFO L158 Benchmark]: TraceAbstraction took 1749.07ms. Allocated memory is still 182.5MB. Free memory was 148.0MB in the beginning and 118.2MB in the end (delta: 29.8MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-10-13 03:28:11,844 INFO L158 Benchmark]: Witness Printer took 4.59ms. Allocated memory is still 182.5MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:28:11,845 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.16ms. Allocated memory is still 117.4MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.49ms. Allocated memory is still 182.5MB. Free memory was 113.3MB in the beginning and 99.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.92ms. Allocated memory is still 182.5MB. Free memory was 99.4MB in the beginning and 97.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.66ms. Allocated memory is still 182.5MB. Free memory was 97.2MB in the beginning and 94.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 599.92ms. Allocated memory is still 182.5MB. Free memory was 94.8MB in the beginning and 148.9MB in the end (delta: -54.1MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1749.07ms. Allocated memory is still 182.5MB. Free memory was 148.0MB in the beginning and 118.2MB in the end (delta: 29.8MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * Witness Printer took 4.59ms. Allocated memory is still 182.5MB. Free memory is still 118.2MB. 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 someBinaryFLOATComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 1; [L26] signed char var_1_9 = 64; [L27] signed char var_1_10 = 4; [L28] signed char var_1_11 = -4; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = 32; [L31] signed char var_1_14 = -64; [L32] signed char var_1_15 = 50; [L33] signed char var_1_16 = 16; [L34] float var_1_17 = 63.5; [L35] signed char last_1_var_1_9 = 64; [L36] signed char last_1_var_1_14 = -64; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_9 = var_1_9 [L98] last_1_var_1_14 = var_1_14 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L68] var_1_4 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L69] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_5=0, var_1_6=1, var_1_9=64] [L70] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L70] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L71] var_1_5 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_6=1, var_1_9=64] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_6=1, var_1_9=64] [L73] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L73] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=1, var_1_9=64] [L74] var_1_6 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_9=64] [L75] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_9=64] [L76] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L76] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=4, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L77] var_1_10 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L78] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L79] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L79] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=-4, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L80] var_1_11 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L81] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L82] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L82] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=32, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L84] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L85] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L85] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=32, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L87] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L88] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L88] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=50, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L89] var_1_15 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L91] CALL assume_abort_if_not(var_1_15 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L91] RET assume_abort_if_not(var_1_15 <= 64) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=16, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L92] var_1_16 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L94] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L94] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L109] RET updateVariables() [L110] CALL step() [L40] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=-255, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L41] COND TRUE ! (last_1_var_1_14 >= last_1_var_1_9) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=-255, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=1, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L42] COND TRUE (var_1_4 || var_1_5) && stepLocal_0 [L43] var_1_1 = ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L50] signed long int stepLocal_3 = (var_1_15 + var_1_16) - ((((64) > (var_1_13)) ? (64) : (var_1_13))); VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_3=0, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=-64, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L51] COND TRUE var_1_12 < stepLocal_3 [L52] var_1_14 = ((64 - var_1_16) - var_1_13) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=0, var_1_15=64, var_1_16=0, var_1_17=127/2, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L56] var_1_17 = 128.91f [L57] unsigned char stepLocal_2 = var_1_14 == var_1_1; [L58] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_1=0, stepLocal_2=0, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=0, var_1_15=64, var_1_16=0, var_1_17=12891/100, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=64] [L59] COND FALSE !(stepLocal_1 && var_1_4) [L64] var_1_9 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_2=0, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=0, var_1_15=64, var_1_16=0, var_1_17=12891/100, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=-65] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return ((((! (last_1_var_1_14 >= last_1_var_1_9)) ? (((var_1_4 || var_1_5) && var_1_6) ? (var_1_1 == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : (var_1_1 == ((signed long int) last_1_var_1_14))) : (var_1_1 == ((signed long int) last_1_var_1_14))) && ((var_1_5 && var_1_4) ? ((var_1_6 || (var_1_14 == var_1_1)) ? (var_1_9 == ((signed char) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))))) : 1) : (var_1_9 == ((signed char) (var_1_12 - var_1_13))))) && ((var_1_12 < ((var_1_15 + var_1_16) - ((((64) > (var_1_13)) ? (64) : (var_1_13))))) ? (var_1_14 == ((signed char) ((64 - var_1_16) - var_1_13))) : (var_1_14 == ((signed char) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))))))) && (var_1_17 == ((float) 128.91f)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=0, var_1_15=64, var_1_16=0, var_1_17=12891/100, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=-65] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10=-127, var_1_11=126, var_1_12=-1, var_1_13=64, var_1_14=0, var_1_15=64, var_1_16=0, var_1_17=12891/100, var_1_1=-64, var_1_4=1, var_1_5=0, var_1_6=-255, var_1_9=-65] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 125 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1224/1224 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-13 03:28:11,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-57.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bbe68fb90de4f0709fb0afd99ee912b5cc4ae214f3f64ef6d7261966d1843e3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:28:14,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:28:14,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:28:14,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:28:14,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:28:14,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:28:14,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:28:14,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:28:14,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:28:14,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:28:14,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:28:14,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:28:14,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:28:14,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:28:14,163 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:28:14,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:28:14,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:28:14,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:28:14,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:28:14,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:28:14,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:28:14,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:28:14,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:28:14,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:28:14,169 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:28:14,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:28:14,170 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:28:14,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:28:14,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:28:14,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:28:14,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:28:14,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:28:14,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:28:14,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:28:14,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:28:14,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:28:14,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:28:14,175 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:28:14,175 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:28:14,175 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:28:14,176 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:28:14,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:28:14,176 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:28:14,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:28:14,176 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:28:14,177 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bbe68fb90de4f0709fb0afd99ee912b5cc4ae214f3f64ef6d7261966d1843e3 [2024-10-13 03:28:14,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:28:14,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:28:14,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:28:14,511 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:28:14,512 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:28:14,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-57.i [2024-10-13 03:28:16,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:28:16,414 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:28:16,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-57.i [2024-10-13 03:28:16,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbe2b775/eae6a4eb954f4737b59050a7f4468c7f/FLAGf1973d537 [2024-10-13 03:28:16,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbe2b775/eae6a4eb954f4737b59050a7f4468c7f [2024-10-13 03:28:16,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:28:16,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:28:16,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:28:16,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:28:16,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:28:16,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3c3197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16, skipping insertion in model container [2024-10-13 03:28:16,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:28:16,680 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_has-floats_file-57.i[917,930] [2024-10-13 03:28:16,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:28:16,759 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:28:16,771 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_has-floats_file-57.i[917,930] [2024-10-13 03:28:16,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:28:16,829 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:28:16,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16 WrapperNode [2024-10-13 03:28:16,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:28:16,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:28:16,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:28:16,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:28:16,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,880 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-13 03:28:16,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:28:16,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:28:16,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:28:16,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:28:16,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,925 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-13 03:28:16,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:28:16,957 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:28:16,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:28:16,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:28:16,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16" (1/1) ... [2024-10-13 03:28:16,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:28:16,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:28:16,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:28:16,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:28:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:28:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:28:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:28:17,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:28:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:28:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:28:17,124 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:28:17,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:28:17,426 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 03:28:17,426 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:28:17,500 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:28:17,501 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:28:17,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:28:17 BoogieIcfgContainer [2024-10-13 03:28:17,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:28:17,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:28:17,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:28:17,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:28:17,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:28:16" (1/3) ... [2024-10-13 03:28:17,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5caeb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:28:17, skipping insertion in model container [2024-10-13 03:28:17,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:28:16" (2/3) ... [2024-10-13 03:28:17,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5caeb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:28:17, skipping insertion in model container [2024-10-13 03:28:17,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:28:17" (3/3) ... [2024-10-13 03:28:17,512 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-57.i [2024-10-13 03:28:17,527 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:28:17,528 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:28:17,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:28:17,602 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;@e96fb66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:28:17,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:28:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:28:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 03:28:17,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:17,621 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 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-13 03:28:17,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:17,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:17,628 INFO L85 PathProgramCache]: Analyzing trace with hash -669129977, now seen corresponding path program 1 times [2024-10-13 03:28:17,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:28:17,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962181449] [2024-10-13 03:28:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:17,644 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-13 03:28:17,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:28:17,647 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:28:17,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 03:28:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:17,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:28:17,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:28:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-10-13 03:28:17,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:28:17,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:28:17,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962181449] [2024-10-13 03:28:17,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962181449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:17,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:17,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:28:17,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414672712] [2024-10-13 03:28:17,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:17,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:28:17,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:28:17,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:28:17,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:28:17,912 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 03:28:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:17,965 INFO L93 Difference]: Finished difference Result 91 states and 160 transitions. [2024-10-13 03:28:17,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:28:17,969 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), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 109 [2024-10-13 03:28:17,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:17,978 INFO L225 Difference]: With dead ends: 91 [2024-10-13 03:28:17,978 INFO L226 Difference]: Without dead ends: 45 [2024-10-13 03:28:17,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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-13 03:28:17,986 INFO L432 NwaCegarLoop]: 64 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, 64 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-13 03:28:17,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:28:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-13 03:28:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-13 03:28:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 03:28:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 67 transitions. [2024-10-13 03:28:18,038 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 67 transitions. Word has length 109 [2024-10-13 03:28:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:18,039 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 67 transitions. [2024-10-13 03:28:18,040 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), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 03:28:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 67 transitions. [2024-10-13 03:28:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 03:28:18,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:18,044 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 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-13 03:28:18,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 03:28:18,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:28:18,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:18,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1043084857, now seen corresponding path program 1 times [2024-10-13 03:28:18,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:28:18,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020096306] [2024-10-13 03:28:18,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:18,249 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-13 03:28:18,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:28:18,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:28:18,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 03:28:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:18,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 03:28:18,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:28:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 03:28:19,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:28:19,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:28:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020096306] [2024-10-13 03:28:19,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020096306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:28:19,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:28:19,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:28:19,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655578348] [2024-10-13 03:28:19,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:28:19,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:28:19,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:28:19,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:28:19,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:28:19,220 INFO L87 Difference]: Start difference. First operand 45 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 03:28:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:28:19,389 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2024-10-13 03:28:19,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:28:19,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2024-10-13 03:28:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:28:19,392 INFO L225 Difference]: With dead ends: 134 [2024-10-13 03:28:19,392 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 03:28:19,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:28:19,394 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 33 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:28:19,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 180 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:28:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 03:28:19,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-10-13 03:28:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 03:28:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 117 transitions. [2024-10-13 03:28:19,421 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 117 transitions. Word has length 109 [2024-10-13 03:28:19,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:28:19,421 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 117 transitions. [2024-10-13 03:28:19,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-13 03:28:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 117 transitions. [2024-10-13 03:28:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 03:28:19,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:28:19,424 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 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-13 03:28:19,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 03:28:19,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:28:19,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:28:19,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:28:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1494859976, now seen corresponding path program 1 times [2024-10-13 03:28:19,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:28:19,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216779528] [2024-10-13 03:28:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:28:19,627 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-13 03:28:19,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:28:19,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:28:19,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 03:28:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:28:19,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-13 03:28:19,785 INFO L278 TraceCheckSpWp]: Computing forward predicates...