./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.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 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:57:13,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:57:14,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:57:14,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:57:14,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:57:14,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:57:14,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:57:14,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:57:14,106 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:57:14,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:57:14,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:57:14,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:57:14,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:57:14,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:57:14,110 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:57:14,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:57:14,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:57:14,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:57:14,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:57:14,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:57:14,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:57:14,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:57:14,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:57:14,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:57:14,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:57:14,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:57:14,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:57:14,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:57:14,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:57:14,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:57:14,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:57:14,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:57:14,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:57:14,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:57:14,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:57:14,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:57:14,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:57:14,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:57:14,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:57:14,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:57:14,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:57:14,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:57:14,120 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 -> 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c [2024-11-08 22:57:14,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:57:14,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:57:14,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:57:14,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:57:14,410 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:57:14,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2024-11-08 22:57:15,831 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:57:16,028 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:57:16,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2024-11-08 22:57:16,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781bba279/eda0a19102514a9e978cfe8c154d127a/FLAG06ce6a47e [2024-11-08 22:57:16,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781bba279/eda0a19102514a9e978cfe8c154d127a [2024-11-08 22:57:16,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:57:16,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:57:16,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:57:16,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:57:16,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:57:16,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3faad255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16, skipping insertion in model container [2024-11-08 22:57:16,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:57:16,269 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_has-floats_file-25.i[917,930] [2024-11-08 22:57:16,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:57:16,324 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:57:16,335 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_has-floats_file-25.i[917,930] [2024-11-08 22:57:16,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:57:16,371 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:57:16,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16 WrapperNode [2024-11-08 22:57:16,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:57:16,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:57:16,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:57:16,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:57:16,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,445 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-08 22:57:16,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:57:16,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:57:16,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:57:16,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:57:16,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,496 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-08 22:57:16,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:57:16,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:57:16,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:57:16,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:57:16,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16" (1/1) ... [2024-11-08 22:57:16,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:57:16,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:57:16,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:57:16,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:57:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:57:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:57:16,607 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:57:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:57:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:57:16,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:57:16,704 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:57:16,707 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:57:17,019 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 22:57:17,022 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:57:17,039 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:57:17,040 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:57:17,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:57:17 BoogieIcfgContainer [2024-11-08 22:57:17,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:57:17,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:57:17,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:57:17,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:57:17,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:57:16" (1/3) ... [2024-11-08 22:57:17,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8e5c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:57:17, skipping insertion in model container [2024-11-08 22:57:17,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:16" (2/3) ... [2024-11-08 22:57:17,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8e5c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:57:17, skipping insertion in model container [2024-11-08 22:57:17,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:57:17" (3/3) ... [2024-11-08 22:57:17,052 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-25.i [2024-11-08 22:57:17,068 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:57:17,069 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:57:17,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:57:17,140 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;@107b896f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:57:17,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:57:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 22:57:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 22:57:17,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:57:17,161 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:57:17,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:57:17,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:57:17,171 INFO L85 PathProgramCache]: Analyzing trace with hash -161856466, now seen corresponding path program 1 times [2024-11-08 22:57:17,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:57:17,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354254743] [2024-11-08 22:57:17,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:57:17,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:57:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:57:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:57:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:57:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:57:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:57:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:57:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:57:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:57:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:57:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:57:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:57:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:57:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:57:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:57:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:57:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:57:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:57:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 22:57:17,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:57:17,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354254743] [2024-11-08 22:57:17,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354254743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:57:17,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:57:17,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:57:17,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579117423] [2024-11-08 22:57:17,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:57:17,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:57:17,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:57:17,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:57:17,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:57:17,648 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:57:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:57:17,675 INFO L93 Difference]: Finished difference Result 105 states and 178 transitions. [2024-11-08 22:57:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:57:17,678 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-08 22:57:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:57:17,686 INFO L225 Difference]: With dead ends: 105 [2024-11-08 22:57:17,686 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 22:57:17,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:57:17,692 INFO L432 NwaCegarLoop]: 76 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, 76 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-08 22:57:17,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:57:17,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 22:57:17,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-08 22:57:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 22:57:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-11-08 22:57:17,734 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 115 [2024-11-08 22:57:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:57:17,734 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-11-08 22:57:17,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:57:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-11-08 22:57:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 22:57:17,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:57:17,739 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:57:17,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:57:17,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:57:17,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:57:17,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1763426518, now seen corresponding path program 1 times [2024-11-08 22:57:17,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:57:17,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039019908] [2024-11-08 22:57:17,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:57:17,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:57:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:57:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:57:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:57:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:57:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:57:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:57:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:57:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:57:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:57:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:57:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:57:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:57:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:57:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:57:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:57:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:57:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:57:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-08 22:57:18,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:57:18,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039019908] [2024-11-08 22:57:18,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039019908] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:57:18,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027666757] [2024-11-08 22:57:18,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:57:18,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:57:18,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:57:18,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:57:18,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 22:57:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:18,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 22:57:18,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:57:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 22:57:18,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:57:18,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027666757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:57:18,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 22:57:18,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-11-08 22:57:18,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711381938] [2024-11-08 22:57:18,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:57:18,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 22:57:18,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:57:18,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 22:57:18,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 22:57:18,827 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:57:19,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:57:19,206 INFO L93 Difference]: Finished difference Result 111 states and 157 transitions. [2024-11-08 22:57:19,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 22:57:19,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-08 22:57:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:57:19,209 INFO L225 Difference]: With dead ends: 111 [2024-11-08 22:57:19,210 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 22:57:19,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-08 22:57:19,213 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 113 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:57:19,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 147 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:57:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 22:57:19,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-11-08 22:57:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 22:57:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2024-11-08 22:57:19,232 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 115 [2024-11-08 22:57:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:57:19,233 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2024-11-08 22:57:19,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:57:19,233 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2024-11-08 22:57:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 22:57:19,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:57:19,235 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:57:19,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 22:57:19,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:57:19,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:57:19,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:57:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash -223690547, now seen corresponding path program 1 times [2024-11-08 22:57:19,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:57:19,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172324059] [2024-11-08 22:57:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:57:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:57:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:57:19,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:57:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:57:19,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:57:19,649 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:57:19,650 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:57:19,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:57:19,658 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 22:57:19,722 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:57:19,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:57:19 BoogieIcfgContainer [2024-11-08 22:57:19,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:57:19,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:57:19,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:57:19,729 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:57:19,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:57:17" (3/4) ... [2024-11-08 22:57:19,732 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:57:19,733 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:57:19,734 INFO L158 Benchmark]: Toolchain (without parser) took 3675.02ms. Allocated memory is still 153.1MB. Free memory was 82.3MB in the beginning and 59.6MB in the end (delta: 22.7MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-08 22:57:19,734 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 111.1MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:57:19,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.39ms. Allocated memory is still 153.1MB. Free memory was 82.1MB in the beginning and 67.6MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 22:57:19,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.69ms. Allocated memory is still 153.1MB. Free memory was 67.6MB in the beginning and 125.5MB in the end (delta: -57.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:57:19,735 INFO L158 Benchmark]: Boogie Preprocessor took 50.80ms. Allocated memory is still 153.1MB. Free memory was 125.5MB in the beginning and 123.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:57:19,736 INFO L158 Benchmark]: RCFGBuilder took 528.75ms. Allocated memory is still 153.1MB. Free memory was 122.5MB in the beginning and 106.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 22:57:19,736 INFO L158 Benchmark]: TraceAbstraction took 2684.14ms. Allocated memory is still 153.1MB. Free memory was 105.1MB in the beginning and 59.6MB in the end (delta: 45.5MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2024-11-08 22:57:19,736 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 153.1MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:57:19,738 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.19ms. Allocated memory is still 111.1MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.39ms. Allocated memory is still 153.1MB. Free memory was 82.1MB in the beginning and 67.6MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.69ms. Allocated memory is still 153.1MB. Free memory was 67.6MB in the beginning and 125.5MB in the end (delta: -57.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.80ms. Allocated memory is still 153.1MB. Free memory was 125.5MB in the beginning and 123.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 528.75ms. Allocated memory is still 153.1MB. Free memory was 122.5MB in the beginning and 106.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2684.14ms. Allocated memory is still 153.1MB. Free memory was 105.1MB in the beginning and 59.6MB in the end (delta: 45.5MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 153.1MB. Free memory is still 59.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 someBinaryFLOATComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 256; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 10; [L25] unsigned short int var_1_4 = 500; [L26] unsigned long int var_1_5 = 0; [L27] unsigned long int var_1_6 = 1509114200; [L28] unsigned long int var_1_7 = 10; [L29] float var_1_8 = 128.9; [L30] float var_1_9 = 63.363; [L31] float var_1_10 = 4.575; [L32] float var_1_11 = 25.5; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; VAL [isInitial=0, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=0, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_3=10, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L74] var_1_3 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L75] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L76] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L76] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_4=500, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L77] var_1_4 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L79] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L79] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=0, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L80] var_1_5 = __VERIFIER_nondet_ulong() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L82] CALL assume_abort_if_not(var_1_5 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L82] RET assume_abort_if_not(var_1_5 <= 1073741823) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=1509114200, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L83] var_1_6 = __VERIFIER_nondet_ulong() [L84] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L84] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=10, var_1_8=1289/10, var_1_9=63363/1000] [L86] var_1_7 = __VERIFIER_nondet_ulong() [L87] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_8=1289/10, var_1_9=63363/1000] [L87] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_8=1289/10, var_1_9=63363/1000] [L88] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10, var_1_9=63363/1000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10, var_1_9=63363/1000] [L88] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10, var_1_9=63363/1000] [L89] var_1_9 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L90] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=183/40, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L91] var_1_10 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L92] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L93] var_1_13 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L94] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L95] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L95] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L96] var_1_14 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L97] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L98] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L98] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_11=51/2, var_1_12=1, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L111] RET updateVariables() [L112] CALL step() [L39] COND FALSE !(var_1_9 != var_1_10) [L46] var_1_12 = var_1_14 VAL [isInitial=1, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L48] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=65535, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_3=65535, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L49] COND TRUE \read(var_1_12) VAL [isInitial=1, stepLocal_0=65535, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_3=65535, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L50] COND FALSE !(stepLocal_0 <= var_1_4) VAL [isInitial=1, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_3=65535, var_1_4=0, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L56] unsigned long int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_1=256, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_3=65535, var_1_4=0, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1289/10] [L57] COND TRUE var_1_7 >= stepLocal_1 [L58] var_1_8 = ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))) VAL [isInitial=1, var_1_11=51/2, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_3=65535, var_1_4=0, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1/2, var_1_9=1/2] [L62] COND TRUE var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8))) [L63] var_1_11 = var_1_10 VAL [isInitial=1, var_1_10=18446742967755472900, var_1_11=18446742967755472900, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_3=65535, var_1_4=0, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1/2, var_1_9=1/2] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((var_1_12 ? ((var_1_3 <= var_1_4) ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) + (var_1_6 - var_1_7)))) : 1) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_7 >= var_1_1) ? (var_1_8 == ((float) ((((0.5f) < (var_1_9)) ? (0.5f) : (var_1_9))))) : (var_1_8 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))))) && ((var_1_10 >= ((((((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) < (var_1_8)) ? (((((128.175f) > (var_1_9)) ? (128.175f) : (var_1_9)))) : (var_1_8)))) ? (var_1_11 == ((float) var_1_10)) : ((! (var_1_7 <= var_1_6)) ? (var_1_11 == ((float) var_1_9)) : 1))) && ((var_1_9 != var_1_10) ? ((var_1_2 || var_1_13) ? (var_1_12 == ((unsigned char) (var_1_13 || var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) : (var_1_12 == ((unsigned char) var_1_14))) ; VAL [\result=0, isInitial=1, var_1_10=18446742967755472900, var_1_11=18446742967755472900, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_3=65535, var_1_4=0, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1/2, var_1_9=1/2] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=18446742967755472900, var_1_11=18446742967755472900, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_3=65535, var_1_4=0, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1/2, var_1_9=1/2] [L19] reach_error() VAL [isInitial=1, var_1_10=18446742967755472900, var_1_11=18446742967755472900, var_1_12=-255, var_1_13=0, var_1_14=-255, var_1_1=256, var_1_2=1, var_1_3=65535, var_1_4=0, var_1_5=-4294967296, var_1_6=18446742967755472895U, var_1_7=-4294967039, var_1_8=1/2, var_1_9=1/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 126 mSDtfsCounter, 152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 461 NumberOfCodeBlocks, 461 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 452 SizeOfPredicates, 1 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1833/1836 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 22:57:19,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.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 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:57:22,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:57:22,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:57:22,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:57:22,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:57:22,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:57:22,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:57:22,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:57:22,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:57:22,151 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:57:22,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:57:22,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:57:22,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:57:22,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:57:22,153 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:57:22,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:57:22,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:57:22,154 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:57:22,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:57:22,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:57:22,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:57:22,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:57:22,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:57:22,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:57:22,159 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:57:22,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:57:22,160 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:57:22,160 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:57:22,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:57:22,161 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:57:22,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:57:22,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:57:22,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:57:22,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:57:22,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:57:22,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:57:22,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:57:22,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:57:22,163 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:57:22,163 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:57:22,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:57:22,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:57:22,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:57:22,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:57:22,166 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 -> 4ec0cc32831f45c9c4bdd4e08577f8de21576bedb3983ee0d68f8f49a302561c [2024-11-08 22:57:22,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:57:22,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:57:22,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:57:22,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:57:22,509 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:57:22,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2024-11-08 22:57:24,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:57:24,276 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:57:24,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-25.i [2024-11-08 22:57:24,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8138d42c2/618f9b74034748c888bad28576582bd3/FLAG0f9616d11 [2024-11-08 22:57:24,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8138d42c2/618f9b74034748c888bad28576582bd3 [2024-11-08 22:57:24,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:57:24,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:57:24,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:57:24,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:57:24,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:57:24,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72379dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24, skipping insertion in model container [2024-11-08 22:57:24,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:57:24,543 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_has-floats_file-25.i[917,930] [2024-11-08 22:57:24,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:57:24,615 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:57:24,631 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_has-floats_file-25.i[917,930] [2024-11-08 22:57:24,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:57:24,687 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:57:24,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24 WrapperNode [2024-11-08 22:57:24,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:57:24,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:57:24,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:57:24,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:57:24,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,751 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-08 22:57:24,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:57:24,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:57:24,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:57:24,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:57:24,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,784 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-08 22:57:24,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:57:24,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:57:24,823 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:57:24,823 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:57:24,824 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24" (1/1) ... [2024-11-08 22:57:24,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:57:24,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:57:24,863 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:57:24,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:57:24,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:57:24,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:57:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:57:24,915 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:57:24,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:57:24,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:57:24,988 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:57:24,990 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:57:25,301 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 22:57:25,302 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:57:25,319 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:57:25,320 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:57:25,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:57:25 BoogieIcfgContainer [2024-11-08 22:57:25,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:57:25,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:57:25,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:57:25,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:57:25,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:57:24" (1/3) ... [2024-11-08 22:57:25,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac9396e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:57:25, skipping insertion in model container [2024-11-08 22:57:25,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:57:24" (2/3) ... [2024-11-08 22:57:25,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac9396e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:57:25, skipping insertion in model container [2024-11-08 22:57:25,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:57:25" (3/3) ... [2024-11-08 22:57:25,330 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-25.i [2024-11-08 22:57:25,348 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:57:25,348 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:57:25,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:57:25,434 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;@5e418ea8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:57:25,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:57:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 22:57:25,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 22:57:25,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:57:25,469 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:57:25,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:57:25,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:57:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash -161856466, now seen corresponding path program 1 times [2024-11-08 22:57:25,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:57:25,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549389331] [2024-11-08 22:57:25,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:57:25,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:57:25,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:57:25,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:57:25,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 22:57:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:25,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:57:25,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:57:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-08 22:57:25,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:57:25,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:57:25,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549389331] [2024-11-08 22:57:25,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549389331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:57:25,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:57:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:57:25,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306535080] [2024-11-08 22:57:25,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:57:25,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:57:25,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:57:25,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:57:25,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:57:25,853 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:57:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:57:25,876 INFO L93 Difference]: Finished difference Result 105 states and 178 transitions. [2024-11-08 22:57:25,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:57:25,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-08 22:57:25,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:57:25,886 INFO L225 Difference]: With dead ends: 105 [2024-11-08 22:57:25,886 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 22:57:25,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-08 22:57:25,895 INFO L432 NwaCegarLoop]: 76 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, 76 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-08 22:57:25,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:57:25,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 22:57:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-08 22:57:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 22:57:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-11-08 22:57:25,947 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 115 [2024-11-08 22:57:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:57:25,948 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-11-08 22:57:25,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:57:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-11-08 22:57:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 22:57:25,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:57:25,952 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:57:25,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 22:57:26,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:57:26,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:57:26,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:57:26,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1763426518, now seen corresponding path program 1 times [2024-11-08 22:57:26,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:57:26,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092489646] [2024-11-08 22:57:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:57:26,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:57:26,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:57:26,165 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:57:26,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 22:57:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:26,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 22:57:26,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:57:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 22:57:26,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:57:26,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:57:26,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092489646] [2024-11-08 22:57:26,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092489646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:57:26,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:57:26,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 22:57:26,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898977300] [2024-11-08 22:57:26,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:57:26,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 22:57:26,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:57:26,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 22:57:26,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:57:26,607 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:57:27,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:57:27,093 INFO L93 Difference]: Finished difference Result 111 states and 157 transitions. [2024-11-08 22:57:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 22:57:27,095 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-08 22:57:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:57:27,097 INFO L225 Difference]: With dead ends: 111 [2024-11-08 22:57:27,098 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 22:57:27,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2024-11-08 22:57:27,099 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 113 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:57:27,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 147 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 22:57:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 22:57:27,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-11-08 22:57:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 22:57:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2024-11-08 22:57:27,118 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 115 [2024-11-08 22:57:27,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:57:27,119 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2024-11-08 22:57:27,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:57:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2024-11-08 22:57:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 22:57:27,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:57:27,124 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:57:27,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 22:57:27,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:57:27,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:57:27,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:57:27,326 INFO L85 PathProgramCache]: Analyzing trace with hash -223690547, now seen corresponding path program 1 times [2024-11-08 22:57:27,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:57:27,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484517043] [2024-11-08 22:57:27,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:57:27,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:57:27,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:57:27,330 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:57:27,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 22:57:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:57:27,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 22:57:27,559 INFO L278 TraceCheckSpWp]: Computing forward predicates...