./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-41.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_no-floats_file-41.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 128ea2693ed29583bc06f96512b4a6af736d68bcef5625bfbd6be2a99fed4e8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:36:35,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:36:35,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:36:35,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:36:35,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:36:35,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:36:35,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:36:35,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:36:35,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:36:35,180 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:36:35,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:36:35,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:36:35,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:36:35,183 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:36:35,184 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:36:35,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:36:35,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:36:35,184 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:36:35,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:36:35,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:36:35,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:36:35,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:36:35,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:36:35,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:36:35,190 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:36:35,190 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:36:35,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:36:35,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:36:35,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:36:35,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:36:35,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:36:35,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:36:35,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:36:35,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:36:35,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:36:35,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:36:35,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:36:35,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:36:35,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:36:35,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:36:35,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:36:35,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:36:35,194 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 -> 128ea2693ed29583bc06f96512b4a6af736d68bcef5625bfbd6be2a99fed4e8c [2024-10-13 03:36:35,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:36:35,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:36:35,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:36:35,492 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:36:35,493 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:36:35,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-41.i [2024-10-13 03:36:36,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:36:37,139 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:36:37,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-41.i [2024-10-13 03:36:37,149 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/396a2ffdd/f152110daf9b4b549580e9c254d02167/FLAG1b3345d9c [2024-10-13 03:36:37,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/396a2ffdd/f152110daf9b4b549580e9c254d02167 [2024-10-13 03:36:37,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:36:37,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:36:37,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:36:37,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:36:37,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:36:37,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:36:37" (1/1) ... [2024-10-13 03:36:37,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f864dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:37, skipping insertion in model container [2024-10-13 03:36:37,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:36:37" (1/1) ... [2024-10-13 03:36:37,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:36:37,406 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-41.i[916,929] [2024-10-13 03:36:37,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:36:37,465 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:36:37,477 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-41.i[916,929] [2024-10-13 03:36:37,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:36:37,520 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:36:37,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:37 WrapperNode [2024-10-13 03:36:37,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:36:37,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:36:37,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:36:37,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:36:37,531 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:36:37" (1/1) ... [2024-10-13 03:36:37,541 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:36:37" (1/1) ... [2024-10-13 03:36:37,574 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-10-13 03:36:37,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:36:37,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:36:37,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:36:37,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:36:37,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:37" (1/1) ... [2024-10-13 03:36:37,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:37" (1/1) ... [2024-10-13 03:36:37,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:37" (1/1) ... [2024-10-13 03:36:37,606 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:36:37,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:37" (1/1) ... [2024-10-13 03:36:37,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:37" (1/1) ... [2024-10-13 03:36:37,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:37" (1/1) ... [2024-10-13 03:36:37,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:37" (1/1) ... [2024-10-13 03:36:37,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:37" (1/1) ... [2024-10-13 03:36:37,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:37" (1/1) ... [2024-10-13 03:36:37,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:36:37,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:36:37,635 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:36:37,635 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:36:37,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:37" (1/1) ... [2024-10-13 03:36:37,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:36:37,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:36:37,679 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:36:37,686 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:36:37,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:36:37,735 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:36:37,735 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:36:37,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:36:37,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:36:37,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:36:37,817 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:36:37,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:36:38,097 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:36:38,098 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:36:38,156 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:36:38,157 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:36:38,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:36:38 BoogieIcfgContainer [2024-10-13 03:36:38,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:36:38,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:36:38,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:36:38,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:36:38,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:36:37" (1/3) ... [2024-10-13 03:36:38,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e813f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:36:38, skipping insertion in model container [2024-10-13 03:36:38,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:37" (2/3) ... [2024-10-13 03:36:38,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e813f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:36:38, skipping insertion in model container [2024-10-13 03:36:38,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:36:38" (3/3) ... [2024-10-13 03:36:38,171 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-41.i [2024-10-13 03:36:38,187 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:36:38,187 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:36:38,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:36:38,255 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;@2bdcb14e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:36:38,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:36:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 03:36:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 03:36:38,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:36:38,271 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:38,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:36:38,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:36:38,277 INFO L85 PathProgramCache]: Analyzing trace with hash -486605615, now seen corresponding path program 1 times [2024-10-13 03:36:38,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:36:38,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797719385] [2024-10-13 03:36:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:36:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:36:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:36:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:36:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:36:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:36:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:36:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:36:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:36:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:36:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:36:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:36:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:36:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:36:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:36:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:36:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-13 03:36:38,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:36:38,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797719385] [2024-10-13 03:36:38,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797719385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:36:38,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:36:38,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:36:38,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380039267] [2024-10-13 03:36:38,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:36:38,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:36:38,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:36:38,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:36:38,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:36:38,652 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 03:36:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:36:38,710 INFO L93 Difference]: Finished difference Result 83 states and 145 transitions. [2024-10-13 03:36:38,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:36:38,714 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 93 [2024-10-13 03:36:38,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:36:38,722 INFO L225 Difference]: With dead ends: 83 [2024-10-13 03:36:38,723 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 03:36:38,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:36:38,733 INFO L432 NwaCegarLoop]: 58 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, 58 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:36:38,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:36:38,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 03:36:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 03:36:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 03:36:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2024-10-13 03:36:38,776 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 93 [2024-10-13 03:36:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:36:38,777 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2024-10-13 03:36:38,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 03:36:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2024-10-13 03:36:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 03:36:38,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:36:38,781 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:38,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:36:38,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:36:38,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:36:38,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2100564943, now seen corresponding path program 1 times [2024-10-13 03:36:38,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:36:38,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488233635] [2024-10-13 03:36:38,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:38,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:36:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:36:38,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:36:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:36:39,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:36:39,029 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:36:39,031 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:36:39,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:36:39,036 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 03:36:39,111 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:36:39,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:36:39 BoogieIcfgContainer [2024-10-13 03:36:39,116 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:36:39,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:36:39,118 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:36:39,118 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:36:39,119 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:36:38" (3/4) ... [2024-10-13 03:36:39,120 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:36:39,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:36:39,123 INFO L158 Benchmark]: Toolchain (without parser) took 1951.57ms. Allocated memory is still 165.7MB. Free memory was 111.7MB in the beginning and 106.3MB in the end (delta: 5.4MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-10-13 03:36:39,124 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:36:39,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.92ms. Allocated memory is still 165.7MB. Free memory was 111.7MB in the beginning and 97.8MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 03:36:39,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.59ms. Allocated memory is still 165.7MB. Free memory was 97.8MB in the beginning and 95.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:36:39,128 INFO L158 Benchmark]: Boogie Preprocessor took 58.47ms. Allocated memory is still 165.7MB. Free memory was 95.4MB in the beginning and 92.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:36:39,129 INFO L158 Benchmark]: RCFGBuilder took 523.81ms. Allocated memory is still 165.7MB. Free memory was 92.4MB in the beginning and 74.0MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 03:36:39,129 INFO L158 Benchmark]: TraceAbstraction took 954.79ms. Allocated memory is still 165.7MB. Free memory was 73.3MB in the beginning and 107.3MB in the end (delta: -34.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:36:39,129 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 165.7MB. Free memory was 107.3MB in the beginning and 106.3MB in the end (delta: 942.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:36:39,131 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.18ms. Allocated memory is still 165.7MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.92ms. Allocated memory is still 165.7MB. Free memory was 111.7MB in the beginning and 97.8MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.59ms. Allocated memory is still 165.7MB. Free memory was 97.8MB in the beginning and 95.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.47ms. Allocated memory is still 165.7MB. Free memory was 95.4MB in the beginning and 92.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 523.81ms. Allocated memory is still 165.7MB. Free memory was 92.4MB in the beginning and 74.0MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 954.79ms. Allocated memory is still 165.7MB. Free memory was 73.3MB in the beginning and 107.3MB in the end (delta: -34.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 165.7MB. Free memory was 107.3MB in the beginning and 106.3MB in the end (delta: 942.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] unsigned char var_1_5 = 0; [L24] signed char var_1_6 = -8; [L25] signed char var_1_7 = 5; [L26] unsigned short int var_1_8 = 2; [L27] unsigned char var_1_11 = 0; [L28] signed long int var_1_12 = 8; [L29] signed long int var_1_13 = 999999999; [L30] signed long int var_1_14 = 10; [L31] signed char var_1_15 = -1; [L32] unsigned char var_1_16 = 16; [L33] unsigned char var_1_17 = 64; [L34] signed char last_1_var_1_1 = -16; [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L93] last_1_var_1_1 = var_1_1 [L103] RET updateLastVariables() [L104] CALL updateVariables() [L69] var_1_5 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_6=-8, var_1_7=5, var_1_8=2] [L71] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L71] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-8, var_1_7=5, var_1_8=2] [L72] var_1_6 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_6 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=5, var_1_8=2] [L73] RET assume_abort_if_not(var_1_6 >= -31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=5, var_1_8=2] [L74] CALL assume_abort_if_not(var_1_6 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=5, var_1_8=2] [L74] RET assume_abort_if_not(var_1_6 <= 31) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=5, var_1_8=2] [L75] var_1_7 = __VERIFIER_nondet_char() [L76] CALL assume_abort_if_not(var_1_7 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L76] RET assume_abort_if_not(var_1_7 >= -63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L77] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L77] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=0, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L79] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L80] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L80] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=999999999, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L81] var_1_13 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L82] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L83] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L83] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=-1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L84] var_1_15 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L85] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L86] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L86] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L87] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L87] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=64, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L88] var_1_17 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L89] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L90] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=-2, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=-2, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L90] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=16, var_1_17=-2, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L104] RET updateVariables() [L105] CALL step() [L38] COND TRUE var_1_5 && (last_1_var_1_1 <= last_1_var_1_1) [L39] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=-2, var_1_17=-2, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L41] var_1_12 = (var_1_13 - 8.3) [L42] unsigned char stepLocal_1 = var_1_13 >= var_1_12; VAL [isInitial=1, last_1_var_1_1=-16, stepLocal_1=1, var_1_11=1, var_1_12=-1, var_1_13=0, var_1_14=10, var_1_15=1, var_1_16=-2, var_1_17=-2, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L43] COND TRUE var_1_5 && stepLocal_1 [L44] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=-1, var_1_13=0, var_1_14=254, var_1_15=1, var_1_16=-2, var_1_17=-2, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=2] [L48] COND TRUE \read(var_1_5) [L49] var_1_8 = (var_1_16 + var_1_16) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=-1, var_1_13=0, var_1_14=254, var_1_15=1, var_1_16=-2, var_1_17=-2, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=508] [L57] unsigned long int stepLocal_0 = (var_1_8 & 0u) * var_1_16; VAL [isInitial=1, last_1_var_1_1=-16, stepLocal_0=0, var_1_11=1, var_1_12=-1, var_1_13=0, var_1_14=254, var_1_15=1, var_1_16=-2, var_1_17=-2, var_1_1=-16, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=508] [L58] COND FALSE !(stepLocal_0 > var_1_8) [L65] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=-1, var_1_13=0, var_1_14=254, var_1_15=1, var_1_16=-2, var_1_17=-2, var_1_1=-31, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=508] [L105] RET step() [L106] CALL, EXPR property() [L96-L97] return (((((((var_1_8 & 0u) * var_1_16) > var_1_8) ? (var_1_5 ? (var_1_1 == ((signed char) ((16 + var_1_6) + var_1_7))) : (var_1_1 == ((signed char) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))) : (var_1_1 == ((signed char) var_1_6))) && (var_1_5 ? (var_1_8 == ((unsigned short int) (var_1_16 + var_1_16))) : (((var_1_16 > var_1_14) || var_1_11) ? (var_1_8 == ((unsigned short int) var_1_16)) : (var_1_8 == ((unsigned short int) var_1_16))))) && (var_1_12 == ((signed long int) (var_1_13 - 8.3)))) && ((var_1_5 && (var_1_13 >= var_1_12)) ? (var_1_14 == ((signed long int) var_1_16)) : (var_1_14 == ((signed long int) var_1_15)))) && ((var_1_5 && (last_1_var_1_1 <= last_1_var_1_1)) ? (var_1_16 == ((unsigned char) var_1_17)) : 1) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=-1, var_1_13=0, var_1_14=254, var_1_15=1, var_1_16=-2, var_1_17=-2, var_1_1=-31, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=508] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-16, var_1_11=1, var_1_12=-1, var_1_13=0, var_1_14=254, var_1_15=1, var_1_16=-2, var_1_17=-2, var_1_1=-31, var_1_5=1, var_1_6=-31, var_1_7=-63, var_1_8=508] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 58 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 92 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 420/420 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:36:39,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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_no-floats_file-41.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 128ea2693ed29583bc06f96512b4a6af736d68bcef5625bfbd6be2a99fed4e8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:36:41,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:36:41,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:36:41,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:36:41,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:36:41,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:36:41,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:36:41,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:36:41,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:36:41,553 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:36:41,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:36:41,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:36:41,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:36:41,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:36:41,556 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:36:41,556 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:36:41,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:36:41,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:36:41,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:36:41,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:36:41,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:36:41,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:36:41,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:36:41,559 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:36:41,559 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:36:41,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:36:41,560 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:36:41,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:36:41,561 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:36:41,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:36:41,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:36:41,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:36:41,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:36:41,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:36:41,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:36:41,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:36:41,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:36:41,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:36:41,563 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:36:41,564 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:36:41,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:36:41,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:36:41,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:36:41,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:36:41,566 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:36:41,567 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 -> 128ea2693ed29583bc06f96512b4a6af736d68bcef5625bfbd6be2a99fed4e8c [2024-10-13 03:36:41,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:36:41,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:36:41,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:36:41,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:36:41,941 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:36:41,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-41.i [2024-10-13 03:36:43,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:36:43,674 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:36:43,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-41.i [2024-10-13 03:36:43,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3a387f2/025d5059cf5c49a4b0dfd87fb65471a1/FLAG6dcea2e74 [2024-10-13 03:36:43,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3a387f2/025d5059cf5c49a4b0dfd87fb65471a1 [2024-10-13 03:36:43,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:36:43,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:36:43,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:36:43,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:36:43,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:36:43,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:36:43" (1/1) ... [2024-10-13 03:36:43,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61afb602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:43, skipping insertion in model container [2024-10-13 03:36:43,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:36:43" (1/1) ... [2024-10-13 03:36:43,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:36:43,921 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-41.i[916,929] [2024-10-13 03:36:43,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:36:43,992 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:36:44,006 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-41.i[916,929] [2024-10-13 03:36:44,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:36:44,057 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:36:44,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:44 WrapperNode [2024-10-13 03:36:44,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:36:44,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:36:44,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:36:44,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:36:44,071 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:36:44" (1/1) ... [2024-10-13 03:36:44,087 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:36:44" (1/1) ... [2024-10-13 03:36:44,117 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-10-13 03:36:44,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:36:44,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:36:44,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:36:44,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:36:44,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:44" (1/1) ... [2024-10-13 03:36:44,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:44" (1/1) ... [2024-10-13 03:36:44,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:44" (1/1) ... [2024-10-13 03:36:44,149 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:36:44,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:44" (1/1) ... [2024-10-13 03:36:44,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:44" (1/1) ... [2024-10-13 03:36:44,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:44" (1/1) ... [2024-10-13 03:36:44,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:44" (1/1) ... [2024-10-13 03:36:44,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:44" (1/1) ... [2024-10-13 03:36:44,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:44" (1/1) ... [2024-10-13 03:36:44,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:36:44,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:36:44,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:36:44,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:36:44,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:44" (1/1) ... [2024-10-13 03:36:44,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:36:44,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:36:44,198 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:36:44,204 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:36:44,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:36:44,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:36:44,256 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:36:44,256 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:36:44,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:36:44,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:36:44,335 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:36:44,338 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:36:46,409 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:36:46,410 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:36:46,484 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:36:46,485 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:36:46,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:36:46 BoogieIcfgContainer [2024-10-13 03:36:46,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:36:46,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:36:46,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:36:46,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:36:46,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:36:43" (1/3) ... [2024-10-13 03:36:46,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b33fb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:36:46, skipping insertion in model container [2024-10-13 03:36:46,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:36:44" (2/3) ... [2024-10-13 03:36:46,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b33fb37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:36:46, skipping insertion in model container [2024-10-13 03:36:46,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:36:46" (3/3) ... [2024-10-13 03:36:46,501 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-41.i [2024-10-13 03:36:46,517 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:36:46,517 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:36:46,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:36:46,601 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;@7f6804ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:36:46,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:36:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 03:36:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 03:36:46,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:36:46,624 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:46,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:36:46,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:36:46,630 INFO L85 PathProgramCache]: Analyzing trace with hash -486605615, now seen corresponding path program 1 times [2024-10-13 03:36:46,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:36:46,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271900024] [2024-10-13 03:36:46,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:46,646 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:36:46,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:36:46,649 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:36:46,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:36:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:46,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:36:46,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:36:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-13 03:36:46,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:36:46,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:36:46,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271900024] [2024-10-13 03:36:46,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271900024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:36:46,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:36:46,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:36:46,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64763372] [2024-10-13 03:36:46,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:36:46,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:36:46,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:36:46,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:36:46,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:36:46,925 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 03:36:47,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:36:47,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:36:47,989 INFO L93 Difference]: Finished difference Result 83 states and 145 transitions. [2024-10-13 03:36:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:36:48,007 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 93 [2024-10-13 03:36:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:36:48,013 INFO L225 Difference]: With dead ends: 83 [2024-10-13 03:36:48,014 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 03:36:48,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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:36:48,019 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:36:48,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 03:36:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 03:36:48,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 03:36:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 03:36:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2024-10-13 03:36:48,053 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 93 [2024-10-13 03:36:48,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:36:48,054 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2024-10-13 03:36:48,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-13 03:36:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2024-10-13 03:36:48,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-13 03:36:48,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:36:48,058 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:48,066 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:36:48,258 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:36:48,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:36:48,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:36:48,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2100564943, now seen corresponding path program 1 times [2024-10-13 03:36:48,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:36:48,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93570772] [2024-10-13 03:36:48,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:48,261 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:36:48,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:36:48,264 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:36:48,267 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:36:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:36:48,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:36:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:36:48,577 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-13 03:36:48,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1787501672] [2024-10-13 03:36:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:36:48,578 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 03:36:48,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 03:36:48,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 03:36:48,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-13 03:36:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:36:48,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 03:36:48,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:36:56,709 WARN L286 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 03:37:06,073 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 03:37:27,952 WARN L286 SmtUtils]: Spent 12.22s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 03:37:34,628 WARN L286 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 03:38:00,799 WARN L286 SmtUtils]: Spent 13.45s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 03:38:08,196 WARN L286 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)