./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-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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-65.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 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:04:53,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:04:53,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:04:53,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:04:53,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:04:53,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:04:53,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:04:53,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:04:53,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:04:53,382 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:04:53,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:04:53,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:04:53,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:04:53,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:04:53,384 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:04:53,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:04:53,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:04:53,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:04:53,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:04:53,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:04:53,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:04:53,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:04:53,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:04:53,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:04:53,387 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:04:53,387 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:04:53,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:04:53,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:04:53,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:04:53,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:04:53,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:04:53,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:04:53,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:04:53,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:04:53,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:04:53,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:04:53,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:04:53,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:04:53,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:04:53,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:04:53,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:04:53,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:04:53,392 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 -> 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f [2024-11-20 06:04:53,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:04:53,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:04:53,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:04:53,621 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:04:53,621 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:04:53,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-11-20 06:04:54,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:04:55,011 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:04:55,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-11-20 06:04:55,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c52163571/bd859d67bdf24cc0904c84cb57d83a81/FLAG2b54e4c76 [2024-11-20 06:04:55,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c52163571/bd859d67bdf24cc0904c84cb57d83a81 [2024-11-20 06:04:55,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:04:55,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:04:55,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:04:55,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:04:55,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:04:55,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788c36c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55, skipping insertion in model container [2024-11-20 06:04:55,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:04:55,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-11-20 06:04:55,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:04:55,241 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:04:55,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-11-20 06:04:55,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:04:55,276 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:04:55,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55 WrapperNode [2024-11-20 06:04:55,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:04:55,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:04:55,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:04:55,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:04:55,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,315 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-20 06:04:55,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:04:55,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:04:55,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:04:55,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:04:55,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,342 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-11-20 06:04:55,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:04:55,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:04:55,358 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:04:55,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:04:55,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55" (1/1) ... [2024-11-20 06:04:55,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:04:55,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:04:55,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:04:55,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:04:55,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:04:55,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:04:55,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:04:55,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:04:55,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:04:55,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:04:55,487 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:04:55,489 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:04:55,666 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 06:04:55,666 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:04:55,679 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:04:55,679 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:04:55,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:04:55 BoogieIcfgContainer [2024-11-20 06:04:55,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:04:55,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:04:55,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:04:55,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:04:55,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:04:55" (1/3) ... [2024-11-20 06:04:55,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae8c529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:04:55, skipping insertion in model container [2024-11-20 06:04:55,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:04:55" (2/3) ... [2024-11-20 06:04:55,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae8c529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:04:55, skipping insertion in model container [2024-11-20 06:04:55,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:04:55" (3/3) ... [2024-11-20 06:04:55,688 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-65.i [2024-11-20 06:04:55,725 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:04:55,726 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:04:55,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:04:55,805 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;@5e8b648b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:04:55,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:04:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 06:04:55,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 06:04:55,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:04:55,818 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 06:04:55,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:04:55,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:04:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1997361240, now seen corresponding path program 1 times [2024-11-20 06:04:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:04:55,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963650169] [2024-11-20 06:04:55,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:04:55,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:04:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:04:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:04:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:04:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:04:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:04:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:04:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:04:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:04:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:04:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:04:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:04:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:04:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:04:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:04:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:04:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:04:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 06:04:56,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:04:56,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963650169] [2024-11-20 06:04:56,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963650169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:04:56,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:04:56,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:04:56,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084279213] [2024-11-20 06:04:56,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:04:56,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:04:56,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:04:56,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:04:56,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:04:56,111 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 06:04:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:04:56,129 INFO L93 Difference]: Finished difference Result 93 states and 158 transitions. [2024-11-20 06:04:56,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:04:56,131 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-11-20 06:04:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:04:56,137 INFO L225 Difference]: With dead ends: 93 [2024-11-20 06:04:56,137 INFO L226 Difference]: Without dead ends: 46 [2024-11-20 06:04:56,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-11-20 06:04:56,143 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:04:56,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:04:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-20 06:04:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-20 06:04:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 06:04:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-20 06:04:56,178 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 102 [2024-11-20 06:04:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:04:56,178 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-20 06:04:56,178 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 06:04:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-20 06:04:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 06:04:56,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:04:56,182 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 06:04:56,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:04:56,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:04:56,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:04:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash 925118552, now seen corresponding path program 1 times [2024-11-20 06:04:56,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:04:56,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928068532] [2024-11-20 06:04:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:04:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:04:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:04:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:04:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:04:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:04:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:04:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:04:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:04:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:04:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:04:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:04:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:04:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:04:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:04:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:04:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:04:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:04:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:04:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-20 06:04:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:04:57,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928068532] [2024-11-20 06:04:57,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928068532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:04:57,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:04:57,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 06:04:57,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074400465] [2024-11-20 06:04:57,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:04:57,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 06:04:57,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:04:57,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 06:04:57,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:04:57,805 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 06:04:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:04:58,012 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2024-11-20 06:04:58,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:04:58,012 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2024-11-20 06:04:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:04:58,014 INFO L225 Difference]: With dead ends: 116 [2024-11-20 06:04:58,014 INFO L226 Difference]: Without dead ends: 73 [2024-11-20 06:04:58,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:04:58,015 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:04:58,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 359 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:04:58,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-20 06:04:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2024-11-20 06:04:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 47 states have internal predecessors, (56), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 06:04:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2024-11-20 06:04:58,026 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 102 [2024-11-20 06:04:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:04:58,027 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2024-11-20 06:04:58,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-20 06:04:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2024-11-20 06:04:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 06:04:58,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:04:58,028 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 06:04:58,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:04:58,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:04:58,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:04:58,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2108976808, now seen corresponding path program 1 times [2024-11-20 06:04:58,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:04:58,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789717292] [2024-11-20 06:04:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:04:58,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:04:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:04:58,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:04:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:04:58,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:04:58,125 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:04:58,126 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:04:58,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:04:58,130 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 06:04:58,203 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:04:58,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:04:58 BoogieIcfgContainer [2024-11-20 06:04:58,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:04:58,209 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:04:58,209 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:04:58,209 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:04:58,209 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:04:55" (3/4) ... [2024-11-20 06:04:58,213 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:04:58,214 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:04:58,216 INFO L158 Benchmark]: Toolchain (without parser) took 3181.01ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 107.3MB in the beginning and 93.6MB in the end (delta: 13.7MB). Peak memory consumption was 91.9MB. Max. memory is 16.1GB. [2024-11-20 06:04:58,217 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 163.6MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:04:58,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.51ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 93.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 06:04:58,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.58ms. Allocated memory is still 163.6MB. Free memory was 93.0MB in the beginning and 90.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:04:58,219 INFO L158 Benchmark]: Boogie Preprocessor took 41.29ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 88.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:04:58,219 INFO L158 Benchmark]: RCFGBuilder took 322.39ms. Allocated memory is still 163.6MB. Free memory was 88.0MB in the beginning and 72.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 06:04:58,220 INFO L158 Benchmark]: TraceAbstraction took 2525.58ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 72.1MB in the beginning and 93.6MB in the end (delta: -21.5MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2024-11-20 06:04:58,220 INFO L158 Benchmark]: Witness Printer took 5.54ms. Allocated memory is still 239.1MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:04:58,221 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.09ms. Allocated memory is still 163.6MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.51ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 93.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.58ms. Allocated memory is still 163.6MB. Free memory was 93.0MB in the beginning and 90.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.29ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 88.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 322.39ms. Allocated memory is still 163.6MB. Free memory was 88.0MB in the beginning and 72.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2525.58ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 72.1MB in the beginning and 93.6MB in the end (delta: -21.5MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * Witness Printer took 5.54ms. Allocated memory is still 239.1MB. Free memory is still 93.6MB. 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 93, overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1000000000; [L23] unsigned char var_1_3 = 1; [L24] signed long int var_1_4 = 8; [L25] signed long int var_1_5 = -32; [L26] signed long int var_1_9 = 100; [L27] signed long int var_1_12 = 25; [L28] signed long int var_1_13 = 63; [L29] signed long int var_1_14 = 0; [L30] signed long int var_1_15 = 0; [L31] signed char var_1_16 = -8; [L32] signed char var_1_17 = 8; [L33] unsigned short int var_1_18 = 2; [L34] unsigned short int var_1_19 = 50; [L35] unsigned short int var_1_20 = 0; [L36] signed long int last_1_var_1_9 = 100; VAL [isInitial=0, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L64] var_1_3 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L65] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L66] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L66] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L67] var_1_4 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L68] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L69] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L69] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L70] var_1_12 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L71] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L72] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L73] var_1_13 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L74] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L75] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L76] var_1_14 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L77] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L78] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L78] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L79] var_1_15 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L80] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L81] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L81] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L82] var_1_17 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L83] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L84] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L84] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L85] var_1_19 = __VERIFIER_nondet_ushort() [L86] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L86] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L87] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=-65536, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=-65536, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L87] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=-65536, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L101] RET updateVariables() [L102] CALL step() [L40] COND FALSE !(0.625f > last_1_var_1_9) [L45] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=-65536, var_1_1=0, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L47] var_1_16 = var_1_17 [L48] var_1_18 = var_1_19 [L49] var_1_20 = var_1_19 VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L50] COND TRUE \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L51] COND TRUE var_1_20 >= ((var_1_18 - var_1_20) * 64) [L52] var_1_9 = (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-32] [L59] COND TRUE var_1_4 > var_1_9 [L60] var_1_5 = (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] [L102] RET step() [L103] CALL, EXPR property() [L93-L94] return ((((((0.625f > last_1_var_1_9) ? (var_1_3 ? (var_1_1 == ((signed long int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) : (var_1_1 == ((signed long int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && ((var_1_4 > var_1_9) ? (var_1_5 == ((signed long int) (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)))) : 1)) && (var_1_3 ? ((var_1_20 >= ((var_1_18 - var_1_20) * 64)) ? (var_1_9 == ((signed long int) (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13))) : 1) : ((var_1_1 <= var_1_1) ? (var_1_9 == ((signed long int) (var_1_13 - (var_1_14 - var_1_15)))) : 1))) && (var_1_16 == ((signed char) var_1_17))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((unsigned short int) var_1_19)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 425 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 290 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 135 mSDtfsCounter, 80 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 06:04:58,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.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 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:05:00,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:05:00,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:05:00,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:05:00,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:05:00,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:05:00,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:05:00,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:05:00,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:05:00,161 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:05:00,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:05:00,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:05:00,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:05:00,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:05:00,162 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:05:00,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:05:00,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:05:00,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:05:00,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:05:00,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:05:00,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:05:00,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:05:00,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:05:00,167 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:05:00,167 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:05:00,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:05:00,168 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:05:00,168 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:05:00,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:05:00,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:05:00,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:05:00,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:05:00,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:05:00,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:05:00,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:05:00,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:05:00,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:05:00,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:05:00,170 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:05:00,170 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:05:00,170 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:05:00,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:05:00,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:05:00,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:05:00,171 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 -> 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f [2024-11-20 06:05:00,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:05:00,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:05:00,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:05:00,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:05:00,458 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:05:00,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-11-20 06:05:01,678 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:05:01,842 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:05:01,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-11-20 06:05:01,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99de7c229/a45de820417144a499982027c09ae3ce/FLAGa5ab4c4c5 [2024-11-20 06:05:01,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99de7c229/a45de820417144a499982027c09ae3ce [2024-11-20 06:05:01,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:05:01,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:05:01,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:05:01,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:05:01,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:05:01,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:05:01" (1/1) ... [2024-11-20 06:05:01,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@443590b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:01, skipping insertion in model container [2024-11-20 06:05:01,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:05:01" (1/1) ... [2024-11-20 06:05:01,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:05:02,050 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-11-20 06:05:02,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:05:02,111 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:05:02,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-11-20 06:05:02,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:05:02,164 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:05:02,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02 WrapperNode [2024-11-20 06:05:02,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:05:02,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:05:02,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:05:02,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:05:02,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02" (1/1) ... [2024-11-20 06:05:02,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02" (1/1) ... [2024-11-20 06:05:02,209 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-20 06:05:02,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:05:02,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:05:02,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:05:02,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:05:02,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02" (1/1) ... [2024-11-20 06:05:02,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02" (1/1) ... [2024-11-20 06:05:02,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02" (1/1) ... [2024-11-20 06:05:02,233 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-11-20 06:05:02,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02" (1/1) ... [2024-11-20 06:05:02,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02" (1/1) ... [2024-11-20 06:05:02,238 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02" (1/1) ... [2024-11-20 06:05:02,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02" (1/1) ... [2024-11-20 06:05:02,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02" (1/1) ... [2024-11-20 06:05:02,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02" (1/1) ... [2024-11-20 06:05:02,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:05:02,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:05:02,249 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:05:02,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:05:02,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02" (1/1) ... [2024-11-20 06:05:02,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:05:02,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:05:02,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:05:02,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:05:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:05:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:05:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:05:02,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:05:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:05:02,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:05:02,359 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:05:02,361 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:05:06,495 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 06:05:06,496 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:05:06,506 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:05:06,506 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:05:06,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:05:06 BoogieIcfgContainer [2024-11-20 06:05:06,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:05:06,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:05:06,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:05:06,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:05:06,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:05:01" (1/3) ... [2024-11-20 06:05:06,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1315d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:05:06, skipping insertion in model container [2024-11-20 06:05:06,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:05:02" (2/3) ... [2024-11-20 06:05:06,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1315d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:05:06, skipping insertion in model container [2024-11-20 06:05:06,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:05:06" (3/3) ... [2024-11-20 06:05:06,512 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-65.i [2024-11-20 06:05:06,524 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:05:06,524 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:05:06,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:05:06,583 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;@ea863f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:05:06,583 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:05:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 06:05:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 06:05:06,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:05:06,596 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 06:05:06,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:05:06,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:05:06,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1997361240, now seen corresponding path program 1 times [2024-11-20 06:05:06,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:05:06,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72786135] [2024-11-20 06:05:06,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:05:06,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:05:06,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:05:06,613 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:05:06,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 06:05:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:05:06,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:05:06,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:05:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-20 06:05:06,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:05:06,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:05:06,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72786135] [2024-11-20 06:05:06,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72786135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:05:06,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:05:06,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:05:06,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814881181] [2024-11-20 06:05:06,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:05:06,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:05:06,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:05:06,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:05:06,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:05:06,916 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 06:05:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:05:06,934 INFO L93 Difference]: Finished difference Result 93 states and 158 transitions. [2024-11-20 06:05:06,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:05:06,936 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-11-20 06:05:06,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:05:06,941 INFO L225 Difference]: With dead ends: 93 [2024-11-20 06:05:06,941 INFO L226 Difference]: Without dead ends: 46 [2024-11-20 06:05:06,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-11-20 06:05:06,946 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:05:06,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:05:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-20 06:05:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-20 06:05:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 06:05:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-20 06:05:06,974 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 102 [2024-11-20 06:05:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:05:06,975 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-20 06:05:06,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 06:05:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-20 06:05:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 06:05:06,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:05:06,978 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 06:05:06,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 06:05:07,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:05:07,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:05:07,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:05:07,179 INFO L85 PathProgramCache]: Analyzing trace with hash 925118552, now seen corresponding path program 1 times [2024-11-20 06:05:07,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:05:07,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304232818] [2024-11-20 06:05:07,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:05:07,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:05:07,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:05:07,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:05:07,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 06:05:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:05:07,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:05:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:05:07,471 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-20 06:05:07,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [895886416] [2024-11-20 06:05:07,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:05:07,472 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 06:05:07,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 06:05:07,475 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-11-20 06:05:07,476 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-11-20 06:05:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:05:07,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-20 06:05:07,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:05:50,820 WARN L286 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:05:58,402 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:06:03,495 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:06:10,257 WARN L286 SmtUtils]: Spent 6.76s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:06:18,173 WARN L286 SmtUtils]: Spent 7.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:06:26,229 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 06:06:32,999 WARN L286 SmtUtils]: Spent 6.67s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)