./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.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 ef69fa322edc34489e265db107286930d1dc540dffa71844564e9de95771e40f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:07:22,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:07:22,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:07:22,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:07:22,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:07:22,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:07:22,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:07:22,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:07:22,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:07:22,614 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:07:22,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:07:22,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:07:22,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:07:22,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:07:22,616 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:07:22,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:07:22,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:07:22,616 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:07:22,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:07:22,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:07:22,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:07:22,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:07:22,618 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:07:22,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:07:22,619 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:07:22,619 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:07:22,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:07:22,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:07:22,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:07:22,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:07:22,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:07:22,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:07:22,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:07:22,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:07:22,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:07:22,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:07:22,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:07:22,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:07:22,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:07:22,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:07:22,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:07:22,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:07:22,623 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 -> ef69fa322edc34489e265db107286930d1dc540dffa71844564e9de95771e40f [2024-11-08 23:07:22,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:07:22,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:07:22,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:07:22,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:07:22,853 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:07:22,853 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-22.i [2024-11-08 23:07:24,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:07:24,469 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:07:24,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.i [2024-11-08 23:07:24,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3324172/fe3c992c148e485daaa2abc188770518/FLAG8eed8acab [2024-11-08 23:07:24,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3324172/fe3c992c148e485daaa2abc188770518 [2024-11-08 23:07:24,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:07:24,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:07:24,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:07:24,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:07:24,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:07:24,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161b655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24, skipping insertion in model container [2024-11-08 23:07:24,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,532 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:07:24,683 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-22.i[916,929] [2024-11-08 23:07:24,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:07:24,725 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:07:24,734 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-22.i[916,929] [2024-11-08 23:07:24,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:07:24,763 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:07:24,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24 WrapperNode [2024-11-08 23:07:24,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:07:24,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:07:24,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:07:24,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:07:24,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,797 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-08 23:07:24,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:07:24,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:07:24,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:07:24,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:07:24,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,821 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:07:24,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:07:24,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:07:24,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:07:24,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:07:24,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24" (1/1) ... [2024-11-08 23:07:24,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:07:24,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:07:24,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:07:24,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:07:24,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:07:24,913 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:07:24,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:07:24,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:07:24,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:07:24,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:07:24,977 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:07:24,979 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:07:25,214 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 23:07:25,214 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:07:25,224 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:07:25,224 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:07:25,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:07:25 BoogieIcfgContainer [2024-11-08 23:07:25,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:07:25,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:07:25,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:07:25,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:07:25,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:07:24" (1/3) ... [2024-11-08 23:07:25,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f496075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:07:25, skipping insertion in model container [2024-11-08 23:07:25,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:24" (2/3) ... [2024-11-08 23:07:25,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f496075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:07:25, skipping insertion in model container [2024-11-08 23:07:25,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:07:25" (3/3) ... [2024-11-08 23:07:25,231 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-22.i [2024-11-08 23:07:25,243 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:07:25,243 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:07:25,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:07:25,293 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;@1d6f1cab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:07:25,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:07:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:07:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 23:07:25,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:07:25,304 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:07:25,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:07:25,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:07:25,308 INFO L85 PathProgramCache]: Analyzing trace with hash -733221916, now seen corresponding path program 1 times [2024-11-08 23:07:25,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:07:25,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714257460] [2024-11-08 23:07:25,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:07:25,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:25,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:07:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:25,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:07:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:25,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:07:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:25,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:07:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:25,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:07:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:25,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:07:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:25,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:07:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:25,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:07:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:25,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:07:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:25,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:07:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:25,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:07:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:25,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:07:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 23:07:25,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:07:25,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714257460] [2024-11-08 23:07:25,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714257460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:07:25,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:07:25,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:07:25,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357119448] [2024-11-08 23:07:25,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:07:25,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:07:25,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:07:25,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:07:25,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:07:25,590 INFO L87 Difference]: Start difference. First operand has 53 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:07:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:07:25,607 INFO L93 Difference]: Finished difference Result 98 states and 162 transitions. [2024-11-08 23:07:25,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:07:25,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2024-11-08 23:07:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:07:25,615 INFO L225 Difference]: With dead ends: 98 [2024-11-08 23:07:25,615 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 23:07:25,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:07:25,621 INFO L432 NwaCegarLoop]: 69 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, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:07:25,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:07:25,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 23:07:25,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 23:07:25,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:07:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-08 23:07:25,653 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 82 [2024-11-08 23:07:25,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:07:25,654 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-08 23:07:25,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:07:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-08 23:07:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 23:07:25,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:07:25,657 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:07:25,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:07:25,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:07:25,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:07:25,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1077548004, now seen corresponding path program 1 times [2024-11-08 23:07:25,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:07:25,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413334462] [2024-11-08 23:07:25,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:07:25,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:07:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:07:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:07:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:07:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:07:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:07:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:07:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:07:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:07:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:07:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:07:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:07:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 23:07:26,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:07:26,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413334462] [2024-11-08 23:07:26,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413334462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:07:26,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:07:26,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:07:26,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995932657] [2024-11-08 23:07:26,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:07:26,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:07:26,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:07:26,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:07:26,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:07:26,327 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:07:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:07:26,584 INFO L93 Difference]: Finished difference Result 159 states and 230 transitions. [2024-11-08 23:07:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:07:26,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-11-08 23:07:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:07:26,588 INFO L225 Difference]: With dead ends: 159 [2024-11-08 23:07:26,588 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 23:07:26,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:07:26,591 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 99 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:07:26,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 157 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:07:26,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 23:07:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 83. [2024-11-08 23:07:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:07:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2024-11-08 23:07:26,614 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 82 [2024-11-08 23:07:26,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:07:26,615 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2024-11-08 23:07:26,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:07:26,615 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2024-11-08 23:07:26,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 23:07:26,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:07:26,620 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:07:26,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:07:26,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:07:26,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:07:26,620 INFO L85 PathProgramCache]: Analyzing trace with hash 950143292, now seen corresponding path program 1 times [2024-11-08 23:07:26,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:07:26,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533019348] [2024-11-08 23:07:26,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:07:26,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:07:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:07:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:07:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:07:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:07:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:07:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:07:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:07:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:07:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:07:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:07:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:07:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 23:07:26,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:07:26,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533019348] [2024-11-08 23:07:26,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533019348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:07:26,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:07:26,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:07:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123822129] [2024-11-08 23:07:26,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:07:26,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:07:26,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:07:26,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:07:26,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:07:26,930 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:07:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:07:27,134 INFO L93 Difference]: Finished difference Result 165 states and 238 transitions. [2024-11-08 23:07:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:07:27,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-08 23:07:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:07:27,136 INFO L225 Difference]: With dead ends: 165 [2024-11-08 23:07:27,136 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 23:07:27,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:07:27,137 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 76 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:07:27,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 175 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:07:27,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 23:07:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2024-11-08 23:07:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:07:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 121 transitions. [2024-11-08 23:07:27,171 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 121 transitions. Word has length 83 [2024-11-08 23:07:27,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:07:27,172 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 121 transitions. [2024-11-08 23:07:27,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:07:27,172 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 121 transitions. [2024-11-08 23:07:27,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 23:07:27,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:07:27,173 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:07:27,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:07:27,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:07:27,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:07:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2107128284, now seen corresponding path program 1 times [2024-11-08 23:07:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:07:27,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692615905] [2024-11-08 23:07:27,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:07:27,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:27,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:07:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:27,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:07:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:27,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:07:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:07:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:27,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:07:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:27,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:07:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:27,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:07:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:27,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:07:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:27,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:07:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:27,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:07:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:27,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:07:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:27,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:07:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 23:07:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:07:27,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692615905] [2024-11-08 23:07:27,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692615905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:07:27,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:07:27,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:07:27,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132500726] [2024-11-08 23:07:27,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:07:27,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:07:27,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:07:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:07:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:07:27,934 INFO L87 Difference]: Start difference. First operand 84 states and 121 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:07:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:07:28,273 INFO L93 Difference]: Finished difference Result 235 states and 333 transitions. [2024-11-08 23:07:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:07:28,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-11-08 23:07:28,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:07:28,278 INFO L225 Difference]: With dead ends: 235 [2024-11-08 23:07:28,278 INFO L226 Difference]: Without dead ends: 190 [2024-11-08 23:07:28,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:07:28,279 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 146 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:07:28,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 224 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:07:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-08 23:07:28,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 161. [2024-11-08 23:07:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 118 states have (on average 1.3220338983050848) internal successors, (156), 119 states have internal predecessors, (156), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 23:07:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 232 transitions. [2024-11-08 23:07:28,316 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 232 transitions. Word has length 83 [2024-11-08 23:07:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:07:28,317 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 232 transitions. [2024-11-08 23:07:28,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:07:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 232 transitions. [2024-11-08 23:07:28,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 23:07:28,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:07:28,318 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:07:28,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:07:28,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:07:28,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:07:28,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1486774434, now seen corresponding path program 1 times [2024-11-08 23:07:28,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:07:28,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714635790] [2024-11-08 23:07:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:07:28,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:28,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:07:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:28,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:07:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:28,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:07:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:28,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:07:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:28,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:07:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:28,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:07:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:28,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:07:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:28,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:07:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:07:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:28,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:07:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:28,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:07:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:28,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:07:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 23:07:28,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:07:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714635790] [2024-11-08 23:07:28,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714635790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:07:28,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:07:28,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:07:28,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464078529] [2024-11-08 23:07:28,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:07:28,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:07:28,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:07:28,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:07:28,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:07:28,421 INFO L87 Difference]: Start difference. First operand 161 states and 232 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:07:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:07:28,449 INFO L93 Difference]: Finished difference Result 286 states and 415 transitions. [2024-11-08 23:07:28,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:07:28,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-08 23:07:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:07:28,453 INFO L225 Difference]: With dead ends: 286 [2024-11-08 23:07:28,454 INFO L226 Difference]: Without dead ends: 169 [2024-11-08 23:07:28,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:07:28,459 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 13 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:07:28,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 127 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:07:28,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-08 23:07:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2024-11-08 23:07:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 118 states have (on average 1.305084745762712) internal successors, (154), 119 states have internal predecessors, (154), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 23:07:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 230 transitions. [2024-11-08 23:07:28,488 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 230 transitions. Word has length 83 [2024-11-08 23:07:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:07:28,488 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 230 transitions. [2024-11-08 23:07:28,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:07:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 230 transitions. [2024-11-08 23:07:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 23:07:28,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:07:28,492 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:07:28,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:07:28,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:07:28,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:07:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash 168168423, now seen corresponding path program 1 times [2024-11-08 23:07:28,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:07:28,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267184596] [2024-11-08 23:07:28,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:07:28,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:07:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:07:28,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:07:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:07:28,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:07:28,597 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:07:28,598 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:07:28,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:07:28,602 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 23:07:28,666 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:07:28,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:07:28 BoogieIcfgContainer [2024-11-08 23:07:28,673 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:07:28,674 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:07:28,674 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:07:28,674 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:07:28,674 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:07:25" (3/4) ... [2024-11-08 23:07:28,676 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:07:28,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:07:28,680 INFO L158 Benchmark]: Toolchain (without parser) took 4177.72ms. Allocated memory was 186.6MB in the beginning and 237.0MB in the end (delta: 50.3MB). Free memory was 154.8MB in the beginning and 130.9MB in the end (delta: 23.9MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2024-11-08 23:07:28,680 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory was 81.8MB in the beginning and 81.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:07:28,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.39ms. Allocated memory is still 186.6MB. Free memory was 154.8MB in the beginning and 140.2MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:07:28,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.27ms. Allocated memory is still 186.6MB. Free memory was 140.2MB in the beginning and 138.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:07:28,681 INFO L158 Benchmark]: Boogie Preprocessor took 35.49ms. Allocated memory is still 186.6MB. Free memory was 138.1MB in the beginning and 133.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:07:28,681 INFO L158 Benchmark]: RCFGBuilder took 390.51ms. Allocated memory is still 186.6MB. Free memory was 133.9MB in the beginning and 115.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:07:28,681 INFO L158 Benchmark]: TraceAbstraction took 3447.28ms. Allocated memory was 186.6MB in the beginning and 237.0MB in the end (delta: 50.3MB). Free memory was 114.0MB in the beginning and 132.0MB in the end (delta: -17.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2024-11-08 23:07:28,681 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 237.0MB. Free memory was 132.0MB in the beginning and 130.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:07:28,686 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.14ms. Allocated memory is still 121.6MB. Free memory was 81.8MB in the beginning and 81.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.39ms. Allocated memory is still 186.6MB. Free memory was 154.8MB in the beginning and 140.2MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.27ms. Allocated memory is still 186.6MB. Free memory was 140.2MB in the beginning and 138.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.49ms. Allocated memory is still 186.6MB. Free memory was 138.1MB in the beginning and 133.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 390.51ms. Allocated memory is still 186.6MB. Free memory was 133.9MB in the beginning and 115.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3447.28ms. Allocated memory was 186.6MB in the beginning and 237.0MB in the end (delta: 50.3MB). Free memory was 114.0MB in the beginning and 132.0MB in the end (delta: -17.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 237.0MB. Free memory was 132.0MB in the beginning and 130.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 90, overapproximation of bitwiseAnd at line 52. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] unsigned char var_1_4 = 0; [L24] unsigned short int var_1_5 = 256; [L25] unsigned short int var_1_6 = 44772; [L26] signed long int var_1_7 = 5; [L27] signed long int var_1_8 = 7; [L28] signed long int var_1_9 = 64; [L29] signed long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 8; [L31] unsigned long int var_1_12 = 3135928546; [L32] signed short int last_1_var_1_1 = -5; [L33] unsigned long int last_1_var_1_11 = 8; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=0, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L86] last_1_var_1_1 = var_1_1 [L87] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=0, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L97] RET updateLastVariables() [L98] CALL updateVariables() [L66] var_1_4 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L68] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L68] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=44772, var_1_7=5, var_1_8=7, var_1_9=64] [L69] var_1_6 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=7, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=7, var_1_9=64] [L70] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=7, var_1_9=64] [L71] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=7, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=7, var_1_9=64] [L71] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=7, var_1_9=64] [L72] var_1_8 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=64] [L73] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=64] [L74] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=64] [L74] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=64] [L75] var_1_9 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=128, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L78] var_1_10 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=3135928546, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L81] var_1_12 = __VERIFIER_nondet_ulong() [L82] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_12 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_12 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L98] RET updateVariables() [L99] CALL step() [L37] signed long int stepLocal_0 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=256, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L38] COND TRUE \read(var_1_4) [L39] var_1_5 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-5, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L45] COND TRUE var_1_5 == var_1_5 [L46] var_1_1 = (var_1_5 + -16) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L52] EXPR var_1_5 & last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L52] COND TRUE last_1_var_1_11 >= (var_1_5 & last_1_var_1_11) [L53] var_1_11 = ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) < ((var_1_12 - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) : ((var_1_12 - last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=5, var_1_8=0, var_1_9=0] [L61] COND TRUE var_1_1 < var_1_5 [L62] var_1_7 = (((10.25f + var_1_8) + var_1_9) + var_1_10) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, stepLocal_0=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_8=0, var_1_9=0] [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR ((((var_1_5 == var_1_5) ? (var_1_1 == ((signed short int) (var_1_5 + -16))) : (var_1_4 ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && (var_1_4 ? (var_1_5 == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? (var_1_5 == ((unsigned short int) ((((last_1_var_1_11) > ((var_1_6 - 8))) ? (last_1_var_1_11) : ((var_1_6 - 8)))))) : 1))) && ((var_1_1 < var_1_5) ? (var_1_7 == ((signed long int) (((10.25f + var_1_8) + var_1_9) + var_1_10))) : 1)) && ((last_1_var_1_11 >= (var_1_5 & last_1_var_1_11)) ? (var_1_11 == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) < ((var_1_12 - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) : ((var_1_12 - last_1_var_1_11)))))) : ((5.7 < var_1_9) ? (var_1_11 == ((unsigned long int) last_1_var_1_11)) : (var_1_11 == ((unsigned long int) last_1_var_1_11)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=4294967296, var_1_8=0, var_1_9=0] [L90-L91] return ((((var_1_5 == var_1_5) ? (var_1_1 == ((signed short int) (var_1_5 + -16))) : (var_1_4 ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && (var_1_4 ? (var_1_5 == ((unsigned short int) last_1_var_1_1)) : ((last_1_var_1_1 <= last_1_var_1_1) ? (var_1_5 == ((unsigned short int) ((((last_1_var_1_11) > ((var_1_6 - 8))) ? (last_1_var_1_11) : ((var_1_6 - 8)))))) : 1))) && ((var_1_1 < var_1_5) ? (var_1_7 == ((signed long int) (((10.25f + var_1_8) + var_1_9) + var_1_10))) : 1)) && ((last_1_var_1_11 >= (var_1_5 & last_1_var_1_11)) ? (var_1_11 == ((unsigned long int) ((((((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) < ((var_1_12 - last_1_var_1_11))) ? (((((((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) < (var_1_6)) ? (((((50u) < (last_1_var_1_11)) ? (50u) : (last_1_var_1_11)))) : (var_1_6)))) : ((var_1_12 - last_1_var_1_11)))))) : ((5.7 < var_1_9) ? (var_1_11 == ((unsigned long int) last_1_var_1_11)) : (var_1_11 == ((unsigned long int) last_1_var_1_11)))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=4294967296, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_1=-5, var_1_10=0, var_1_11=8, var_1_12=4294967294, var_1_1=-21, var_1_4=1, var_1_5=-5, var_1_6=32767, var_1_7=4294967296, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 334 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 334 mSDsluCounter, 752 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 428 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 324 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=4, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 98 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 1684 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1320/1320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:07:28,715 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-22.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 ef69fa322edc34489e265db107286930d1dc540dffa71844564e9de95771e40f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:07:31,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:07:31,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:07:31,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:07:31,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:07:31,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:07:31,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:07:31,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:07:31,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:07:31,138 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:07:31,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:07:31,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:07:31,139 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:07:31,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:07:31,140 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:07:31,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:07:31,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:07:31,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:07:31,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:07:31,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:07:31,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:07:31,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:07:31,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:07:31,145 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:07:31,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:07:31,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:07:31,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:07:31,149 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:07:31,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:07:31,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:07:31,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:07:31,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:07:31,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:07:31,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:07:31,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:07:31,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:07:31,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:07:31,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:07:31,151 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:07:31,151 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:07:31,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:07:31,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:07:31,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:07:31,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:07:31,152 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 -> ef69fa322edc34489e265db107286930d1dc540dffa71844564e9de95771e40f [2024-11-08 23:07:31,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:07:31,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:07:31,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:07:31,447 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:07:31,451 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:07:31,453 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-22.i [2024-11-08 23:07:32,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:07:33,057 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:07:33,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-22.i [2024-11-08 23:07:33,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4265647b/f738cfba76d74a23949a554170f00831/FLAG67b9b5b07 [2024-11-08 23:07:33,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4265647b/f738cfba76d74a23949a554170f00831 [2024-11-08 23:07:33,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:07:33,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:07:33,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:07:33,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:07:33,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:07:33,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b935fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33, skipping insertion in model container [2024-11-08 23:07:33,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:07:33,281 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-22.i[916,929] [2024-11-08 23:07:33,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:07:33,336 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:07:33,349 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-22.i[916,929] [2024-11-08 23:07:33,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:07:33,383 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:07:33,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33 WrapperNode [2024-11-08 23:07:33,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:07:33,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:07:33,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:07:33,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:07:33,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,423 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-08 23:07:33,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:07:33,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:07:33,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:07:33,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:07:33,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,455 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:07:33,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:07:33,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:07:33,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:07:33,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:07:33,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33" (1/1) ... [2024-11-08 23:07:33,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:07:33,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:07:33,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:07:33,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:07:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:07:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:07:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:07:33,559 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:07:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:07:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:07:33,641 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:07:33,643 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:07:42,101 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 23:07:42,101 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:07:42,111 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:07:42,112 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:07:42,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:07:42 BoogieIcfgContainer [2024-11-08 23:07:42,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:07:42,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:07:42,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:07:42,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:07:42,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:07:33" (1/3) ... [2024-11-08 23:07:42,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa4b95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:07:42, skipping insertion in model container [2024-11-08 23:07:42,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:07:33" (2/3) ... [2024-11-08 23:07:42,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa4b95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:07:42, skipping insertion in model container [2024-11-08 23:07:42,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:07:42" (3/3) ... [2024-11-08 23:07:42,120 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-22.i [2024-11-08 23:07:42,134 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:07:42,134 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:07:42,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:07:42,183 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;@46b6107d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:07:42,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:07:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:07:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 23:07:42,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:07:42,196 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:07:42,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:07:42,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:07:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash 859769863, now seen corresponding path program 1 times [2024-11-08 23:07:42,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:07:42,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500179826] [2024-11-08 23:07:42,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:07:42,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:07:42,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:07:42,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:07:42,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:07:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:42,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:07:42,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:07:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-08 23:07:42,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:07:42,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:07:42,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500179826] [2024-11-08 23:07:42,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500179826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:07:42,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:07:42,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:07:42,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389710565] [2024-11-08 23:07:42,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:07:42,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:07:42,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:07:42,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:07:42,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:07:42,452 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:07:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:07:42,468 INFO L93 Difference]: Finished difference Result 79 states and 132 transitions. [2024-11-08 23:07:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:07:42,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-11-08 23:07:42,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:07:42,475 INFO L225 Difference]: With dead ends: 79 [2024-11-08 23:07:42,475 INFO L226 Difference]: Without dead ends: 38 [2024-11-08 23:07:42,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:07:42,480 INFO L432 NwaCegarLoop]: 52 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, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:07:42,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:07:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-08 23:07:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-08 23:07:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:07:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2024-11-08 23:07:42,507 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 79 [2024-11-08 23:07:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:07:42,508 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2024-11-08 23:07:42,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:07:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2024-11-08 23:07:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 23:07:42,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:07:42,511 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:07:42,518 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-08 23:07:42,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:07:42,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:07:42,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:07:42,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1304304633, now seen corresponding path program 1 times [2024-11-08 23:07:42,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:07:42,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310713912] [2024-11-08 23:07:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:07:42,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:07:42,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:07:42,720 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:07:42,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:07:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:07:42,981 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:07:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:07:43,173 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-08 23:07:43,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1550006802] [2024-11-08 23:07:43,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:07:43,174 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 23:07:43,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 23:07:43,178 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-08 23:07:43,183 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-08 23:07:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:07:43,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 23:07:43,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:07:53,036 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:08:01,139 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:08:09,241 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:08:17,343 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:08:24,635 WARN L286 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:08:31,383 WARN L286 SmtUtils]: Spent 6.75s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:08:38,212 WARN L286 SmtUtils]: Spent 6.83s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:08:46,314 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:08:54,417 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:09:02,520 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)