./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_no-floats_file-0.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 2f7348383fbfe60948d51b6a2558ece637bf3e6137abb8f292fdbb0029f6276f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:49:23,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:49:23,502 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:49:23,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:49:23,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:49:23,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:49:23,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:49:23,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:49:23,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:49:23,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:49:23,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:49:23,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:49:23,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:49:23,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:49:23,553 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:49:23,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:49:23,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:49:23,554 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:49:23,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:49:23,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:49:23,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:49:23,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:49:23,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:49:23,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:49:23,558 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:49:23,558 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:49:23,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:49:23,559 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:49:23,559 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:49:23,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:49:23,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:49:23,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:49:23,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:49:23,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:49:23,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:49:23,561 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:49:23,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:49:23,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:49:23,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:49:23,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:49:23,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:49:23,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:49:23,563 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 -> 2f7348383fbfe60948d51b6a2558ece637bf3e6137abb8f292fdbb0029f6276f [2024-11-10 06:49:23,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:49:23,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:49:23,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:49:23,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:49:23,847 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:49:23,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-0.i [2024-11-10 06:49:25,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:49:25,562 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:49:25,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-0.i [2024-11-10 06:49:25,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebf5b21d/25f79146876c4148bc2561271f267908/FLAGbded55d0f [2024-11-10 06:49:25,597 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebf5b21d/25f79146876c4148bc2561271f267908 [2024-11-10 06:49:25,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:49:25,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:49:25,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:49:25,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:49:25,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:49:25,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:25,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5434bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25, skipping insertion in model container [2024-11-10 06:49:25,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:25,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:49:25,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-0.i[915,928] [2024-11-10 06:49:25,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:49:25,886 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:49:25,898 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-0.i[915,928] [2024-11-10 06:49:25,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:49:25,946 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:49:25,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25 WrapperNode [2024-11-10 06:49:25,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:49:25,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:49:25,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:49:25,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:49:25,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:25,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:26,010 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2024-11-10 06:49:26,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:49:26,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:49:26,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:49:26,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:49:26,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:26,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:26,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:26,042 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-10 06:49:26,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:26,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:26,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:26,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:26,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:26,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:26,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:49:26,054 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:49:26,054 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:49:26,054 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:49:26,055 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25" (1/1) ... [2024-11-10 06:49:26,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:49:26,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:49:26,094 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-10 06:49:26,098 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-10 06:49:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:49:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:49:26,161 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:49:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:49:26,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:49:26,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:49:26,245 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:49:26,247 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:49:26,488 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 06:49:26,489 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:49:26,507 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:49:26,508 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:49:26,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:49:26 BoogieIcfgContainer [2024-11-10 06:49:26,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:49:26,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:49:26,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:49:26,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:49:26,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:49:25" (1/3) ... [2024-11-10 06:49:26,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9a4735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:49:26, skipping insertion in model container [2024-11-10 06:49:26,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:25" (2/3) ... [2024-11-10 06:49:26,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d9a4735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:49:26, skipping insertion in model container [2024-11-10 06:49:26,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:49:26" (3/3) ... [2024-11-10 06:49:26,519 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-0.i [2024-11-10 06:49:26,535 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:49:26,536 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:49:26,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:49:26,616 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;@7993e879, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:49:26,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:49:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 06:49:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 06:49:26,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:49:26,634 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:49:26,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:49:26,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:49:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash -772342400, now seen corresponding path program 1 times [2024-11-10 06:49:26,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:49:26,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500182018] [2024-11-10 06:49:26,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:49:26,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:49:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:26,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:49:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:26,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:49:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:49:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:49:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:49:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:49:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:26,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:49:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:49:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:26,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:49:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:49:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 06:49:26,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:49:26,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500182018] [2024-11-10 06:49:26,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500182018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:49:26,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:49:26,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:49:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36509053] [2024-11-10 06:49:26,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:49:26,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:49:26,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:49:26,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:49:26,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:49:26,971 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 06:49:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:49:26,992 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2024-11-10 06:49:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:49:26,996 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 70 [2024-11-10 06:49:26,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:49:27,003 INFO L225 Difference]: With dead ends: 83 [2024-11-10 06:49:27,003 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 06:49:27,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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-10 06:49:27,009 INFO L432 NwaCegarLoop]: 55 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, 55 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-10 06:49:27,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:49:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 06:49:27,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-10 06:49:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 06:49:27,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2024-11-10 06:49:27,077 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 70 [2024-11-10 06:49:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:49:27,077 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2024-11-10 06:49:27,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 06:49:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2024-11-10 06:49:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 06:49:27,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:49:27,102 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:49:27,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:49:27,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:49:27,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:49:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash 522792480, now seen corresponding path program 1 times [2024-11-10 06:49:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:49:27,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17860441] [2024-11-10 06:49:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:49:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:49:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:49:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:49:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:27,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:49:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:27,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:49:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:27,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:49:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:28,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:49:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:28,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:49:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:28,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:49:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:28,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:49:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:28,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:49:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 06:49:28,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:49:28,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17860441] [2024-11-10 06:49:28,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17860441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:49:28,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:49:28,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 06:49:28,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816533591] [2024-11-10 06:49:28,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:49:28,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:49:28,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:49:28,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:49:28,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:49:28,028 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 06:49:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:49:28,235 INFO L93 Difference]: Finished difference Result 115 states and 157 transitions. [2024-11-10 06:49:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 06:49:28,236 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 70 [2024-11-10 06:49:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:49:28,242 INFO L225 Difference]: With dead ends: 115 [2024-11-10 06:49:28,243 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 06:49:28,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 06:49:28,245 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 57 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:49:28,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 262 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:49:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 06:49:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2024-11-10 06:49:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 52 states have internal predecessors, (63), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 06:49:28,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2024-11-10 06:49:28,274 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 70 [2024-11-10 06:49:28,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:49:28,276 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2024-11-10 06:49:28,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 06:49:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2024-11-10 06:49:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 06:49:28,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:49:28,279 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:49:28,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:49:28,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:49:28,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:49:28,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1410296161, now seen corresponding path program 1 times [2024-11-10 06:49:28,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:49:28,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965316801] [2024-11-10 06:49:28,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:49:28,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:49:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:49:28,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:49:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:49:28,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:49:28,387 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:49:28,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:49:28,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:49:28,393 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 06:49:28,474 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:49:28,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:49:28 BoogieIcfgContainer [2024-11-10 06:49:28,480 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:49:28,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:49:28,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:49:28,481 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:49:28,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:49:26" (3/4) ... [2024-11-10 06:49:28,484 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:49:28,487 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:49:28,488 INFO L158 Benchmark]: Toolchain (without parser) took 2886.14ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 136.9MB in the beginning and 139.0MB in the end (delta: -2.1MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2024-11-10 06:49:28,490 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 134.2MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:49:28,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.25ms. Allocated memory is still 167.8MB. Free memory was 136.7MB in the beginning and 126.5MB in the end (delta: 10.2MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-10 06:49:28,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.75ms. Allocated memory is still 167.8MB. Free memory was 126.5MB in the beginning and 124.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:49:28,491 INFO L158 Benchmark]: Boogie Preprocessor took 38.44ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 122.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 06:49:28,491 INFO L158 Benchmark]: IcfgBuilder took 455.29ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 107.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 06:49:28,492 INFO L158 Benchmark]: TraceAbstraction took 1967.95ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 107.0MB in the beginning and 139.0MB in the end (delta: -32.0MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-11-10 06:49:28,492 INFO L158 Benchmark]: Witness Printer took 5.93ms. Allocated memory is still 203.4MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:49:28,494 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.17ms. Allocated memory is still 134.2MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.25ms. Allocated memory is still 167.8MB. Free memory was 136.7MB in the beginning and 126.5MB in the end (delta: 10.2MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.75ms. Allocated memory is still 167.8MB. Free memory was 126.5MB in the beginning and 124.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.44ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 122.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 455.29ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 107.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1967.95ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 107.0MB in the beginning and 139.0MB in the end (delta: -32.0MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. * Witness Printer took 5.93ms. Allocated memory is still 203.4MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 25; [L23] unsigned char var_1_2 = 1; [L24] signed long int var_1_3 = 128; [L25] signed long int var_1_4 = 15; [L26] signed long int var_1_5 = 5; [L27] unsigned char var_1_9 = 1; [L28] unsigned char var_1_10 = 100; [L29] unsigned char var_1_12 = 1; [L30] unsigned short int var_1_13 = 5; [L31] signed long int last_1_var_1_5 = 5; [L32] unsigned char last_1_var_1_10 = 100; [L33] unsigned short int last_1_var_1_13 = 5; VAL [isInitial=0, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=128, var_1_4=15, var_1_5=5, var_1_9=1] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L86] last_1_var_1_5 = var_1_5 [L87] last_1_var_1_10 = var_1_10 [L88] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=128, var_1_4=15, var_1_5=5, var_1_9=1] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_3=128, var_1_4=15, var_1_5=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_3=128, var_1_4=15, var_1_5=5, var_1_9=1] [L70] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_3=128, var_1_4=15, var_1_5=5, var_1_9=1] [L71] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=128, var_1_4=15, var_1_5=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=128, var_1_4=15, var_1_5=5, var_1_9=1] [L71] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=128, var_1_4=15, var_1_5=5, var_1_9=1] [L72] var_1_3 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=15, var_1_5=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=15, var_1_5=5, var_1_9=1] [L73] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=15, var_1_5=5, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=15, var_1_5=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=15, var_1_5=5, var_1_9=1] [L74] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=15, var_1_5=5, var_1_9=1] [L75] var_1_4 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=1] [L76] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=1] [L77] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=1] [L78] var_1_9 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5] [L79] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5] [L80] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=0] [L80] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=0] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=0] [L82] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=0, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=0, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=0] [L83] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=0, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=0] [L99] RET updateVariables() [L100] CALL step() [L37] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=0, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=0] [L42] COND FALSE !((last_1_var_1_13 + last_1_var_1_13) < last_1_var_1_13) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=0, var_1_13=5, var_1_1=25, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=0] [L47] COND FALSE !(! var_1_2) [L50] var_1_1 = ((((16.2) < (var_1_3)) ? (16.2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=0, var_1_13=5, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=5, var_1_9=0] [L52] COND FALSE !((var_1_3 + (var_1_4 + var_1_1)) != var_1_1) [L65] var_1_5 = var_1_3 VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=0, var_1_13=5, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L100] RET step() [L101] CALL, EXPR property() [L91-L92] return ((((! var_1_2) ? (var_1_1 == ((signed long int) (var_1_3 - var_1_4))) : (var_1_1 == ((signed long int) ((((16.2) < (var_1_3)) ? (16.2) : (var_1_3)))))) && (((var_1_3 + (var_1_4 + var_1_1)) != var_1_1) ? (var_1_2 ? (((- var_1_13) <= var_1_10) ? (var_1_9 ? (var_1_5 == ((signed long int) var_1_4)) : 1) : (var_1_5 == ((signed long int) var_1_3))) : (var_1_5 == ((signed long int) var_1_3))) : (var_1_5 == ((signed long int) var_1_3)))) && (((last_1_var_1_13 + last_1_var_1_13) < last_1_var_1_13) ? ((last_1_var_1_13 > last_1_var_1_13) ? (var_1_10 == ((unsigned char) var_1_12)) : 1) : 1)) && (var_1_9 ? (((var_1_4 * (var_1_3 - 5.3)) <= last_1_var_1_5) ? (var_1_13 == ((unsigned short int) last_1_var_1_10)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=0, var_1_13=5, var_1_1=-1, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=0, var_1_13=5, var_1_1=-1, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=5, var_1_10=100, var_1_12=0, var_1_13=5, var_1_1=-1, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 317 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 123 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=2, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 360/360 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-10 06:49:28,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_no-floats_file-0.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 2f7348383fbfe60948d51b6a2558ece637bf3e6137abb8f292fdbb0029f6276f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:49:31,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:49:31,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:49:31,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:49:31,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:49:31,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:49:31,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:49:31,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:49:31,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:49:31,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:49:31,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:49:31,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:49:31,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:49:31,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:49:31,138 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:49:31,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:49:31,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:49:31,139 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:49:31,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:49:31,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:49:31,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:49:31,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:49:31,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:49:31,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:49:31,141 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:49:31,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:49:31,142 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:49:31,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:49:31,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:49:31,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:49:31,143 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:49:31,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:49:31,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:49:31,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:49:31,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:49:31,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:49:31,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:49:31,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:49:31,152 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:49:31,152 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:49:31,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:49:31,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:49:31,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:49:31,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:49:31,153 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 -> 2f7348383fbfe60948d51b6a2558ece637bf3e6137abb8f292fdbb0029f6276f [2024-11-10 06:49:31,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:49:31,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:49:31,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:49:31,581 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:49:31,581 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:49:31,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-0.i [2024-11-10 06:49:33,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:49:33,502 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:49:33,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-0.i [2024-11-10 06:49:33,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b18a53cf/50e5d085186e49df89630aa9eee7c2dc/FLAGafbf7bae7 [2024-11-10 06:49:33,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b18a53cf/50e5d085186e49df89630aa9eee7c2dc [2024-11-10 06:49:33,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:49:33,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:49:33,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:49:33,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:49:33,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:49:33,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:33,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec2b2c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33, skipping insertion in model container [2024-11-10 06:49:33,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:33,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:49:33,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-0.i[915,928] [2024-11-10 06:49:33,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:49:33,821 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:49:33,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-0.i[915,928] [2024-11-10 06:49:33,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:49:33,888 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:49:33,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33 WrapperNode [2024-11-10 06:49:33,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:49:33,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:49:33,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:49:33,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:49:33,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:33,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:33,942 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-10 06:49:33,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:49:33,946 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:49:33,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:49:33,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:49:33,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:33,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:33,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:33,982 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-10 06:49:33,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:33,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:33,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:33,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:33,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:34,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:34,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:49:34,008 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:49:34,008 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:49:34,008 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:49:34,009 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33" (1/1) ... [2024-11-10 06:49:34,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:49:34,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:49:34,041 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-10 06:49:34,048 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-10 06:49:34,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:49:34,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:49:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:49:34,096 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:49:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:49:34,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:49:34,187 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:49:34,189 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:49:47,315 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 06:49:47,315 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:49:47,329 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:49:47,329 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:49:47,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:49:47 BoogieIcfgContainer [2024-11-10 06:49:47,330 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:49:47,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:49:47,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:49:47,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:49:47,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:49:33" (1/3) ... [2024-11-10 06:49:47,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333185f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:49:47, skipping insertion in model container [2024-11-10 06:49:47,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:49:33" (2/3) ... [2024-11-10 06:49:47,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333185f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:49:47, skipping insertion in model container [2024-11-10 06:49:47,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:49:47" (3/3) ... [2024-11-10 06:49:47,350 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-0.i [2024-11-10 06:49:47,370 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:49:47,371 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:49:47,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:49:47,450 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;@5f555e0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:49:47,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:49:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 06:49:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 06:49:47,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:49:47,467 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:49:47,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:49:47,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:49:47,475 INFO L85 PathProgramCache]: Analyzing trace with hash -772342400, now seen corresponding path program 1 times [2024-11-10 06:49:47,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:49:47,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209994039] [2024-11-10 06:49:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:49:47,493 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-10 06:49:47,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:49:47,498 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-10 06:49:47,499 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-10 06:49:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:47,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:49:47,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:49:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-10 06:49:47,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:49:47,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:49:47,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209994039] [2024-11-10 06:49:47,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209994039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:49:47,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:49:47,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:49:47,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140503885] [2024-11-10 06:49:47,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:49:47,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:49:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:49:47,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:49:47,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:49:47,946 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 06:49:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:49:47,975 INFO L93 Difference]: Finished difference Result 83 states and 135 transitions. [2024-11-10 06:49:47,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:49:47,979 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 70 [2024-11-10 06:49:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:49:47,987 INFO L225 Difference]: With dead ends: 83 [2024-11-10 06:49:47,987 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 06:49:47,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 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-10 06:49:47,996 INFO L432 NwaCegarLoop]: 55 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, 55 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-10 06:49:47,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:49:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 06:49:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-10 06:49:48,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 06:49:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2024-11-10 06:49:48,047 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 70 [2024-11-10 06:49:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:49:48,047 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2024-11-10 06:49:48,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 06:49:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2024-11-10 06:49:48,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-10 06:49:48,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:49:48,052 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:49:48,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 06:49:48,253 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-10 06:49:48,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:49:48,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:49:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash 522792480, now seen corresponding path program 1 times [2024-11-10 06:49:48,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:49:48,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073606158] [2024-11-10 06:49:48,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:49:48,256 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-10 06:49:48,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:49:48,260 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-10 06:49:48,261 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-10 06:49:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:49:48,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:49:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:49:48,823 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-10 06:49:48,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1327031430] [2024-11-10 06:49:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:49:48,824 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 06:49:48,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 06:49:48,848 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 06:49:48,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-10 06:49:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:49:49,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 06:49:49,257 INFO L278 TraceCheckSpWp]: Computing forward predicates...