./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.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 3d47f2d590788b5b215b1242024ad3fa5a12acabdbb9cad16a442da1352e0490 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:48:02,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:48:02,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 23:48:02,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:48:02,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:48:02,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:48:02,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:48:02,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:48:02,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:48:02,201 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:48:02,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:48:02,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:48:02,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:48:02,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:48:02,203 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:48:02,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:48:02,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:48:02,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:48:02,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:48:02,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:48:02,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:48:02,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:48:02,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:48:02,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:48:02,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:48:02,211 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:48:02,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:48:02,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:48:02,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:48:02,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:48:02,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:48:02,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:48:02,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:48:02,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:48:02,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:48:02,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:48:02,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:48:02,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:48:02,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:48:02,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:48:02,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:48:02,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:48:02,218 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 -> 3d47f2d590788b5b215b1242024ad3fa5a12acabdbb9cad16a442da1352e0490 [2024-10-12 23:48:02,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:48:02,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:48:02,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:48:02,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:48:02,478 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:48:02,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i [2024-10-12 23:48:03,880 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:48:04,090 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:48:04,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i [2024-10-12 23:48:04,112 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/154f4ea4a/6afdf899ee674cdfa132e879557d5a39/FLAG90fd8f576 [2024-10-12 23:48:04,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/154f4ea4a/6afdf899ee674cdfa132e879557d5a39 [2024-10-12 23:48:04,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:48:04,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:48:04,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:48:04,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:48:04,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:48:04,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d454e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04, skipping insertion in model container [2024-10-12 23:48:04,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:48:04,644 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i[918,931] [2024-10-12 23:48:04,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:48:04,698 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:48:04,709 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i[918,931] [2024-10-12 23:48:04,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:48:04,764 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:48:04,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04 WrapperNode [2024-10-12 23:48:04,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:48:04,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:48:04,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:48:04,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:48:04,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,829 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-10-12 23:48:04,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:48:04,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:48:04,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:48:04,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:48:04,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,844 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,864 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:48:04,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:48:04,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:48:04,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:48:04,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:48:04,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04" (1/1) ... [2024-10-12 23:48:04,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:48:04,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:48:04,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:48:04,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:48:04,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:48:04,976 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:48:04,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:48:04,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:48:04,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:48:04,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:48:05,040 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:48:05,042 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:48:05,462 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-12 23:48:05,463 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:48:05,503 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:48:05,503 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:48:05,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:48:05 BoogieIcfgContainer [2024-10-12 23:48:05,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:48:05,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:48:05,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:48:05,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:48:05,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:48:04" (1/3) ... [2024-10-12 23:48:05,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d01ef27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:48:05, skipping insertion in model container [2024-10-12 23:48:05,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:04" (2/3) ... [2024-10-12 23:48:05,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d01ef27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:48:05, skipping insertion in model container [2024-10-12 23:48:05,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:48:05" (3/3) ... [2024-10-12 23:48:05,516 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-3.i [2024-10-12 23:48:05,532 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:48:05,533 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:48:05,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:48:05,610 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;@dd2ff5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:48:05,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:48:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 45 states have internal predecessors, (71), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 23:48:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 23:48:05,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:48:05,629 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:48:05,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:48:05,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:48:05,637 INFO L85 PathProgramCache]: Analyzing trace with hash 81185174, now seen corresponding path program 1 times [2024-10-12 23:48:05,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:48:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478681452] [2024-10-12 23:48:05,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:48:05,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:48:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:05,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:48:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:05,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:48:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:05,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:48:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:05,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:48:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:05,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:48:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:05,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:48:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:05,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:48:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:05,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:48:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:05,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:48:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:48:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:48:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:48:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:48:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:48:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:48:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:48:06,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:48:06,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478681452] [2024-10-12 23:48:06,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478681452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:48:06,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:48:06,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:48:06,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055923310] [2024-10-12 23:48:06,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:48:06,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:48:06,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:48:06,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:48:06,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:48:06,071 INFO L87 Difference]: Start difference. First operand has 62 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 45 states have internal predecessors, (71), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 23:48:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:48:06,121 INFO L93 Difference]: Finished difference Result 121 states and 215 transitions. [2024-10-12 23:48:06,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:48:06,126 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-10-12 23:48:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:48:06,133 INFO L225 Difference]: With dead ends: 121 [2024-10-12 23:48:06,134 INFO L226 Difference]: Without dead ends: 60 [2024-10-12 23:48:06,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:48:06,143 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:48:06,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:48:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-12 23:48:06,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-12 23:48:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 43 states have internal predecessors, (65), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 23:48:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 95 transitions. [2024-10-12 23:48:06,185 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 95 transitions. Word has length 98 [2024-10-12 23:48:06,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:48:06,186 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 95 transitions. [2024-10-12 23:48:06,186 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 23:48:06,187 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 95 transitions. [2024-10-12 23:48:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 23:48:06,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:48:06,190 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:48:06,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:48:06,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:48:06,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:48:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1629016408, now seen corresponding path program 1 times [2024-10-12 23:48:06,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:48:06,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359632064] [2024-10-12 23:48:06,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:48:06,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:48:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:48:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:48:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:48:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:48:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:48:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:48:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:48:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:48:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:48:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:48:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:48:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:48:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:48:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:48:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:48:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:48:06,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:48:06,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359632064] [2024-10-12 23:48:06,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359632064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:48:06,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:48:06,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:48:06,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895699134] [2024-10-12 23:48:06,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:48:06,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:48:06,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:48:06,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:48:06,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:48:06,704 INFO L87 Difference]: Start difference. First operand 60 states and 95 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:48:06,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:48:06,796 INFO L93 Difference]: Finished difference Result 178 states and 283 transitions. [2024-10-12 23:48:06,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:48:06,799 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-12 23:48:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:48:06,803 INFO L225 Difference]: With dead ends: 178 [2024-10-12 23:48:06,805 INFO L226 Difference]: Without dead ends: 119 [2024-10-12 23:48:06,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-10-12 23:48:06,807 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 59 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:48:06,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 162 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:48:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-12 23:48:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2024-10-12 23:48:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 84 states have internal predecessors, (124), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-12 23:48:06,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 184 transitions. [2024-10-12 23:48:06,845 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 184 transitions. Word has length 98 [2024-10-12 23:48:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:48:06,857 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 184 transitions. [2024-10-12 23:48:06,857 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:48:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 184 transitions. [2024-10-12 23:48:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 23:48:06,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:48:06,862 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:48:06,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:48:06,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:48:06,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:48:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1794937485, now seen corresponding path program 1 times [2024-10-12 23:48:06,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:48:06,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651132241] [2024-10-12 23:48:06,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:48:06,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:48:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:48:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:48:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:48:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:48:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:48:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:48:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:48:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:48:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:48:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:48:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:48:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:48:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:48:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:48:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:48:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:48:07,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:48:07,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651132241] [2024-10-12 23:48:07,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651132241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:48:07,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:48:07,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:48:07,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017446080] [2024-10-12 23:48:07,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:48:07,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:48:07,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:48:07,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:48:07,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:48:07,092 INFO L87 Difference]: Start difference. First operand 117 states and 184 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:48:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:48:07,216 INFO L93 Difference]: Finished difference Result 341 states and 540 transitions. [2024-10-12 23:48:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:48:07,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-10-12 23:48:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:48:07,220 INFO L225 Difference]: With dead ends: 341 [2024-10-12 23:48:07,220 INFO L226 Difference]: Without dead ends: 225 [2024-10-12 23:48:07,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-10-12 23:48:07,223 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 82 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:48:07,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 236 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:48:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-12 23:48:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-10-12 23:48:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 158 states have (on average 1.4556962025316456) internal successors, (230), 158 states have internal predecessors, (230), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-12 23:48:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 350 transitions. [2024-10-12 23:48:07,276 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 350 transitions. Word has length 99 [2024-10-12 23:48:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:48:07,276 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 350 transitions. [2024-10-12 23:48:07,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:48:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 350 transitions. [2024-10-12 23:48:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 23:48:07,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:48:07,281 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:48:07,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:48:07,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:48:07,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:48:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1176598845, now seen corresponding path program 1 times [2024-10-12 23:48:07,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:48:07,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77964884] [2024-10-12 23:48:07,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:48:07,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:48:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:48:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:48:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:48:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:48:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:48:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:48:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:48:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:48:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:48:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:48:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:48:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:48:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:48:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:48:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:48:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:48:07,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:48:07,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77964884] [2024-10-12 23:48:07,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77964884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:48:07,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:48:07,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:48:07,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161188403] [2024-10-12 23:48:07,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:48:07,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:48:07,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:48:07,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:48:07,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:48:07,445 INFO L87 Difference]: Start difference. First operand 223 states and 350 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:48:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:48:07,493 INFO L93 Difference]: Finished difference Result 543 states and 852 transitions. [2024-10-12 23:48:07,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:48:07,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-10-12 23:48:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:48:07,498 INFO L225 Difference]: With dead ends: 543 [2024-10-12 23:48:07,499 INFO L226 Difference]: Without dead ends: 321 [2024-10-12 23:48:07,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-10-12 23:48:07,509 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:48:07,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 197 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:48:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-12 23:48:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 247. [2024-10-12 23:48:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 182 states have (on average 1.4615384615384615) internal successors, (266), 182 states have internal predecessors, (266), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-12 23:48:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 386 transitions. [2024-10-12 23:48:07,556 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 386 transitions. Word has length 99 [2024-10-12 23:48:07,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:48:07,558 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 386 transitions. [2024-10-12 23:48:07,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:48:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 386 transitions. [2024-10-12 23:48:07,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 23:48:07,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:48:07,563 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:48:07,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:48:07,564 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:48:07,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:48:07,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1074866731, now seen corresponding path program 1 times [2024-10-12 23:48:07,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:48:07,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530384080] [2024-10-12 23:48:07,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:48:07,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:48:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:48:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:48:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:48:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:48:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:48:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:48:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:48:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:48:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:48:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:48:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:48:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:48:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:48:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:48:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:48:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-10-12 23:48:08,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:48:08,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530384080] [2024-10-12 23:48:08,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530384080] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:48:08,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160939916] [2024-10-12 23:48:08,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:48:08,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:48:08,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:48:08,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:48:08,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 23:48:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:08,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 23:48:08,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:48:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 287 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-12 23:48:09,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:48:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 87 proven. 30 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-10-12 23:48:09,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160939916] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:48:09,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:48:09,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 26 [2024-10-12 23:48:09,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556583577] [2024-10-12 23:48:09,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:48:09,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-12 23:48:09,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:48:09,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 23:48:09,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2024-10-12 23:48:09,988 INFO L87 Difference]: Start difference. First operand 247 states and 386 transitions. Second operand has 26 states, 26 states have (on average 3.0) internal successors, (78), 26 states have internal predecessors, (78), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (33), 9 states have call predecessors, (33), 6 states have call successors, (33) [2024-10-12 23:48:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:48:10,956 INFO L93 Difference]: Finished difference Result 503 states and 756 transitions. [2024-10-12 23:48:10,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 23:48:10,957 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0) internal successors, (78), 26 states have internal predecessors, (78), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (33), 9 states have call predecessors, (33), 6 states have call successors, (33) Word has length 100 [2024-10-12 23:48:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:48:10,959 INFO L225 Difference]: With dead ends: 503 [2024-10-12 23:48:10,959 INFO L226 Difference]: Without dead ends: 257 [2024-10-12 23:48:10,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=578, Invalid=1402, Unknown=0, NotChecked=0, Total=1980 [2024-10-12 23:48:10,962 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 675 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:48:10,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 240 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:48:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-12 23:48:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 241. [2024-10-12 23:48:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 188 states have (on average 1.4042553191489362) internal successors, (264), 190 states have internal predecessors, (264), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-12 23:48:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 348 transitions. [2024-10-12 23:48:10,989 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 348 transitions. Word has length 100 [2024-10-12 23:48:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:48:10,989 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 348 transitions. [2024-10-12 23:48:10,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0) internal successors, (78), 26 states have internal predecessors, (78), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (33), 9 states have call predecessors, (33), 6 states have call successors, (33) [2024-10-12 23:48:10,990 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 348 transitions. [2024-10-12 23:48:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 23:48:10,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:48:10,992 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:48:11,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 23:48:11,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:48:11,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:48:11,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:48:11,196 INFO L85 PathProgramCache]: Analyzing trace with hash 944794874, now seen corresponding path program 1 times [2024-10-12 23:48:11,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:48:11,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052542651] [2024-10-12 23:48:11,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:48:11,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:48:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:48:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:48:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:48:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:48:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:48:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:48:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:48:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:48:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:48:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:48:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:48:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:48:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:48:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:48:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:48:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:48:11,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:48:11,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052542651] [2024-10-12 23:48:11,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052542651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:48:11,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:48:11,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:48:11,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743154541] [2024-10-12 23:48:11,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:48:11,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:48:11,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:48:11,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:48:11,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:48:11,404 INFO L87 Difference]: Start difference. First operand 241 states and 348 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:48:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:48:11,572 INFO L93 Difference]: Finished difference Result 604 states and 877 transitions. [2024-10-12 23:48:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:48:11,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-10-12 23:48:11,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:48:11,580 INFO L225 Difference]: With dead ends: 604 [2024-10-12 23:48:11,581 INFO L226 Difference]: Without dead ends: 483 [2024-10-12 23:48:11,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:48:11,582 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 110 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:48:11,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 201 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:48:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-12 23:48:11,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 477. [2024-10-12 23:48:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 372 states have (on average 1.4086021505376345) internal successors, (524), 376 states have internal predecessors, (524), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 80 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-12 23:48:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 692 transitions. [2024-10-12 23:48:11,628 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 692 transitions. Word has length 100 [2024-10-12 23:48:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:48:11,629 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 692 transitions. [2024-10-12 23:48:11,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:48:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 692 transitions. [2024-10-12 23:48:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 23:48:11,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:48:11,631 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:48:11,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 23:48:11,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:48:11,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:48:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1814100560, now seen corresponding path program 1 times [2024-10-12 23:48:11,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:48:11,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274406614] [2024-10-12 23:48:11,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:48:11,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:48:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:48:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:48:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:48:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:48:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:48:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:48:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:48:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:48:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:48:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:48:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:48:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:48:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:48:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:48:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:48:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:48:11,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:48:11,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274406614] [2024-10-12 23:48:11,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274406614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:48:11,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:48:11,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:48:11,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369142056] [2024-10-12 23:48:11,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:48:11,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:48:11,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:48:11,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:48:11,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:48:11,871 INFO L87 Difference]: Start difference. First operand 477 states and 692 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 23:48:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:48:12,231 INFO L93 Difference]: Finished difference Result 1195 states and 1727 transitions. [2024-10-12 23:48:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:48:12,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2024-10-12 23:48:12,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:48:12,236 INFO L225 Difference]: With dead ends: 1195 [2024-10-12 23:48:12,237 INFO L226 Difference]: Without dead ends: 719 [2024-10-12 23:48:12,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:48:12,239 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 268 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:48:12,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 358 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 23:48:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-10-12 23:48:12,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 705. [2024-10-12 23:48:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 548 states have (on average 1.4014598540145986) internal successors, (768), 554 states have internal predecessors, (768), 126 states have call successors, (126), 30 states have call predecessors, (126), 30 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2024-10-12 23:48:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1020 transitions. [2024-10-12 23:48:12,307 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1020 transitions. Word has length 101 [2024-10-12 23:48:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:48:12,308 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1020 transitions. [2024-10-12 23:48:12,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 23:48:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1020 transitions. [2024-10-12 23:48:12,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 23:48:12,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:48:12,309 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:48:12,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 23:48:12,310 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:48:12,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:48:12,310 INFO L85 PathProgramCache]: Analyzing trace with hash 490249566, now seen corresponding path program 1 times [2024-10-12 23:48:12,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:48:12,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531121370] [2024-10-12 23:48:12,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:48:12,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:48:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:48:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:48:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:48:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:48:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:48:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:48:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:48:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:48:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:48:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:48:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:48:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 23:48:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:48:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 23:48:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:48:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:48:12,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:48:12,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531121370] [2024-10-12 23:48:12,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531121370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:48:12,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:48:12,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:48:12,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272594023] [2024-10-12 23:48:12,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:48:12,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:48:12,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:48:12,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:48:12,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:48:12,537 INFO L87 Difference]: Start difference. First operand 705 states and 1020 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:48:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:48:12,742 INFO L93 Difference]: Finished difference Result 1544 states and 2249 transitions. [2024-10-12 23:48:12,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:48:12,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-10-12 23:48:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:48:12,750 INFO L225 Difference]: With dead ends: 1544 [2024-10-12 23:48:12,751 INFO L226 Difference]: Without dead ends: 1189 [2024-10-12 23:48:12,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:48:12,754 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 154 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:48:12,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 260 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:48:12,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2024-10-12 23:48:12,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1071. [2024-10-12 23:48:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 838 states have (on average 1.4069212410501193) internal successors, (1179), 844 states have internal predecessors, (1179), 186 states have call successors, (186), 46 states have call predecessors, (186), 46 states have return successors, (186), 180 states have call predecessors, (186), 186 states have call successors, (186) [2024-10-12 23:48:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1551 transitions. [2024-10-12 23:48:12,859 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1551 transitions. Word has length 101 [2024-10-12 23:48:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:48:12,860 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1551 transitions. [2024-10-12 23:48:12,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:48:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1551 transitions. [2024-10-12 23:48:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 23:48:12,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:48:12,861 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:48:12,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 23:48:12,862 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:48:12,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:48:12,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1668922056, now seen corresponding path program 1 times [2024-10-12 23:48:12,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:48:12,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093806661] [2024-10-12 23:48:12,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:48:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:48:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 23:48:12,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1888605699] [2024-10-12 23:48:12,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:48:12,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:48:12,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:48:12,900 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:48:12,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 23:48:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:48:12,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:48:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:48:13,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:48:13,097 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:48:13,098 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:48:13,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 23:48:13,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-12 23:48:13,303 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:48:13,375 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:48:13,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:48:13 BoogieIcfgContainer [2024-10-12 23:48:13,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:48:13,378 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:48:13,378 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:48:13,379 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:48:13,381 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:48:05" (3/4) ... [2024-10-12 23:48:13,383 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:48:13,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:48:13,384 INFO L158 Benchmark]: Toolchain (without parser) took 8930.27ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 154.6MB in the beginning and 100.6MB in the end (delta: 54.0MB). Peak memory consumption was 91.6MB. Max. memory is 16.1GB. [2024-10-12 23:48:13,384 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:48:13,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.83ms. Allocated memory is still 184.5MB. Free memory was 154.6MB in the beginning and 139.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 23:48:13,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.06ms. Allocated memory is still 184.5MB. Free memory was 139.8MB in the beginning and 136.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:48:13,385 INFO L158 Benchmark]: Boogie Preprocessor took 71.15ms. Allocated memory is still 184.5MB. Free memory was 136.1MB in the beginning and 130.6MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 23:48:13,385 INFO L158 Benchmark]: RCFGBuilder took 602.12ms. Allocated memory is still 184.5MB. Free memory was 130.6MB in the beginning and 106.2MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-12 23:48:13,386 INFO L158 Benchmark]: TraceAbstraction took 7871.63ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 105.4MB in the beginning and 100.6MB in the end (delta: 4.8MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2024-10-12 23:48:13,386 INFO L158 Benchmark]: Witness Printer took 5.33ms. Allocated memory is still 222.3MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:48:13,387 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.15ms. Allocated memory is still 125.8MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.83ms. Allocated memory is still 184.5MB. Free memory was 154.6MB in the beginning and 139.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.06ms. Allocated memory is still 184.5MB. Free memory was 139.8MB in the beginning and 136.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.15ms. Allocated memory is still 184.5MB. Free memory was 136.1MB in the beginning and 130.6MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 602.12ms. Allocated memory is still 184.5MB. Free memory was 130.6MB in the beginning and 106.2MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7871.63ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 105.4MB in the beginning and 100.6MB in the end (delta: 4.8MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * Witness Printer took 5.33ms. Allocated memory is still 222.3MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of bitwiseOr at line 78. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int last_1_var_1_10 = 256; [L38] unsigned char last_1_var_1_20 = 32; [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L110] last_1_var_1_10 = var_1_10 [L111] last_1_var_1_20 = var_1_20 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L85] var_1_3 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L86] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L87] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L87] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L91] var_1_13 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L92] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L94] var_1_14 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L95] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L97] var_1_15 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L98] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L100] var_1_16 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L101] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] var_1_21 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L103] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L104] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L104] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L105] var_1_22 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L106] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L122] RET updateVariables() [L123] CALL step() [L42] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L47] COND TRUE (var_1_5 * var_1_13) > last_1_var_1_10 [L48] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L50] COND FALSE !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L55] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L66] COND FALSE !((var_1_17 <= var_1_17) || var_1_3) [L71] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L73] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L78] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L78] COND TRUE var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23) [L79] COND TRUE var_1_12 == var_1_12 [L80] var_1_10 = 0u VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L114-L115] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1385 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1385 mSDsluCounter, 1746 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 958 mSDsCounter, 405 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 703 IncrementalHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 405 mSolverCounterUnsat, 788 mSDtfsCounter, 703 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 519 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1071occurred in iteration=8, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 232 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1100 NumberOfCodeBlocks, 1100 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 986 ConstructedInterpolants, 0 QuantifiedInterpolants, 3057 SizeOfPredicates, 7 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 4146/4200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 23:48:13,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.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 3d47f2d590788b5b215b1242024ad3fa5a12acabdbb9cad16a442da1352e0490 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:48:15,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:48:15,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 23:48:15,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:48:15,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:48:15,670 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:48:15,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:48:15,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:48:15,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:48:15,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:48:15,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:48:15,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:48:15,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:48:15,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:48:15,678 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:48:15,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:48:15,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:48:15,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:48:15,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:48:15,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:48:15,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:48:15,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:48:15,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:48:15,681 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:48:15,682 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:48:15,682 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:48:15,682 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:48:15,682 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:48:15,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:48:15,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:48:15,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:48:15,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:48:15,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:48:15,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:48:15,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:48:15,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:48:15,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:48:15,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:48:15,686 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:48:15,686 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:48:15,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:48:15,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:48:15,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:48:15,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:48:15,687 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:48:15,688 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 -> 3d47f2d590788b5b215b1242024ad3fa5a12acabdbb9cad16a442da1352e0490 [2024-10-12 23:48:15,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:48:16,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:48:16,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:48:16,019 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:48:16,019 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:48:16,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i [2024-10-12 23:48:17,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:48:17,655 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:48:17,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i [2024-10-12 23:48:17,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dbca73b0/a3fa326e8b774499bd9deebad23b8b10/FLAGeb70db920 [2024-10-12 23:48:17,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dbca73b0/a3fa326e8b774499bd9deebad23b8b10 [2024-10-12 23:48:17,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:48:17,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:48:17,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:48:17,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:48:17,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:48:17,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:48:17" (1/1) ... [2024-10-12 23:48:17,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132f7f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:17, skipping insertion in model container [2024-10-12 23:48:17,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:48:17" (1/1) ... [2024-10-12 23:48:17,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:48:17,916 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i[918,931] [2024-10-12 23:48:17,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:48:18,007 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:48:18,020 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i[918,931] [2024-10-12 23:48:18,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:48:18,075 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:48:18,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18 WrapperNode [2024-10-12 23:48:18,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:48:18,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:48:18,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:48:18,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:48:18,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18" (1/1) ... [2024-10-12 23:48:18,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18" (1/1) ... [2024-10-12 23:48:18,134 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-12 23:48:18,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:48:18,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:48:18,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:48:18,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:48:18,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18" (1/1) ... [2024-10-12 23:48:18,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18" (1/1) ... [2024-10-12 23:48:18,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18" (1/1) ... [2024-10-12 23:48:18,177 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:48:18,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18" (1/1) ... [2024-10-12 23:48:18,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18" (1/1) ... [2024-10-12 23:48:18,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18" (1/1) ... [2024-10-12 23:48:18,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18" (1/1) ... [2024-10-12 23:48:18,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18" (1/1) ... [2024-10-12 23:48:18,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18" (1/1) ... [2024-10-12 23:48:18,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:48:18,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:48:18,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:48:18,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:48:18,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18" (1/1) ... [2024-10-12 23:48:18,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:48:18,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:48:18,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:48:18,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:48:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:48:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:48:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:48:18,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:48:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:48:18,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:48:18,390 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:48:18,392 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:48:33,402 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 23:48:33,403 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:48:33,440 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:48:33,441 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:48:33,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:48:33 BoogieIcfgContainer [2024-10-12 23:48:33,441 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:48:33,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:48:33,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:48:33,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:48:33,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:48:17" (1/3) ... [2024-10-12 23:48:33,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e6e12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:48:33, skipping insertion in model container [2024-10-12 23:48:33,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:48:18" (2/3) ... [2024-10-12 23:48:33,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e6e12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:48:33, skipping insertion in model container [2024-10-12 23:48:33,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:48:33" (3/3) ... [2024-10-12 23:48:33,452 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-3.i [2024-10-12 23:48:33,468 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:48:33,469 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:48:33,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:48:33,545 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;@4357b901, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:48:33,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:48:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 23:48:33,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 23:48:33,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:48:33,559 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:48:33,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:48:33,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:48:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash -385064748, now seen corresponding path program 1 times [2024-10-12 23:48:33,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:48:33,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431810084] [2024-10-12 23:48:33,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:48:33,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:48:33,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:48:33,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:48:33,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 23:48:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:34,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 23:48:34,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:48:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-10-12 23:48:34,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:48:34,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:48:34,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431810084] [2024-10-12 23:48:34,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431810084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:48:34,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:48:34,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:48:34,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370090958] [2024-10-12 23:48:34,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:48:34,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:48:34,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:48:34,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:48:34,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:48:34,595 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 23:48:38,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:48:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:48:38,931 INFO L93 Difference]: Finished difference Result 99 states and 179 transitions. [2024-10-12 23:48:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:48:39,039 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 95 [2024-10-12 23:48:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:48:39,046 INFO L225 Difference]: With dead ends: 99 [2024-10-12 23:48:39,047 INFO L226 Difference]: Without dead ends: 49 [2024-10-12 23:48:39,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:48:39,053 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:48:39,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-12 23:48:39,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-12 23:48:39,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-12 23:48:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 23:48:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 77 transitions. [2024-10-12 23:48:39,095 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 77 transitions. Word has length 95 [2024-10-12 23:48:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:48:39,096 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 77 transitions. [2024-10-12 23:48:39,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 23:48:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 77 transitions. [2024-10-12 23:48:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 23:48:39,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:48:39,099 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:48:39,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 23:48:39,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:48:39,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:48:39,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:48:39,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2103230382, now seen corresponding path program 1 times [2024-10-12 23:48:39,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:48:39,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356073985] [2024-10-12 23:48:39,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:48:39,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:48:39,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:48:39,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:48:39,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 23:48:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:48:40,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 23:48:40,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:48:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:48:45,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:48:45,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:48:45,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356073985] [2024-10-12 23:48:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356073985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:48:45,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:48:45,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:48:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494642663] [2024-10-12 23:48:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:48:45,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:48:45,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:48:45,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:48:45,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:48:45,263 INFO L87 Difference]: Start difference. First operand 49 states and 77 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:48:48,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:48:52,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:48:53,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:48:54,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:48:58,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:49:03,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:49:08,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:49:12,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:49:16,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:49:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:49:16,376 INFO L93 Difference]: Finished difference Result 145 states and 229 transitions. [2024-10-12 23:49:16,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:49:16,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-12 23:49:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:49:16,381 INFO L225 Difference]: With dead ends: 145 [2024-10-12 23:49:16,381 INFO L226 Difference]: Without dead ends: 97 [2024-10-12 23:49:16,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:49:16,383 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 27 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:49:16,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 134 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 31.1s Time] [2024-10-12 23:49:16,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-12 23:49:16,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-10-12 23:49:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.435483870967742) internal successors, (89), 62 states have internal predecessors, (89), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-12 23:49:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2024-10-12 23:49:16,417 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 149 transitions. Word has length 95 [2024-10-12 23:49:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:49:16,418 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 149 transitions. [2024-10-12 23:49:16,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:49:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2024-10-12 23:49:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 23:49:16,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:49:16,421 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:49:16,450 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 (3)] Forceful destruction successful, exit code 0 [2024-10-12 23:49:16,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:49:16,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:49:16,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:49:16,623 INFO L85 PathProgramCache]: Analyzing trace with hash -619412995, now seen corresponding path program 1 times [2024-10-12 23:49:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:49:16,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502858910] [2024-10-12 23:49:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:49:16,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:49:16,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:49:16,627 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:49:16,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 23:49:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:49:17,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 23:49:17,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:49:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:49:17,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:49:17,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:49:17,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502858910] [2024-10-12 23:49:17,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502858910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:49:17,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:49:17,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:49:17,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238054346] [2024-10-12 23:49:17,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:49:17,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:49:17,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:49:17,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:49:17,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:49:17,696 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:49:22,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:49:26,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:49:30,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 23:49:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:49:30,337 INFO L93 Difference]: Finished difference Result 221 states and 348 transitions. [2024-10-12 23:49:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:49:30,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2024-10-12 23:49:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:49:30,342 INFO L225 Difference]: With dead ends: 221 [2024-10-12 23:49:30,342 INFO L226 Difference]: Without dead ends: 127 [2024-10-12 23:49:30,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:49:30,344 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 24 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-10-12 23:49:30,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 133 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2024-10-12 23:49:30,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-12 23:49:30,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2024-10-12 23:49:30,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 72 states have internal predecessors, (102), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-12 23:49:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 162 transitions. [2024-10-12 23:49:30,360 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 162 transitions. Word has length 96 [2024-10-12 23:49:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:49:30,361 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 162 transitions. [2024-10-12 23:49:30,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:49:30,361 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 162 transitions. [2024-10-12 23:49:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 23:49:30,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:49:30,363 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:49:30,394 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 (4)] Forceful destruction successful, exit code 0 [2024-10-12 23:49:30,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:49:30,564 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:49:30,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:49:30,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1121027644, now seen corresponding path program 1 times [2024-10-12 23:49:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:49:30,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350873788] [2024-10-12 23:49:30,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:49:30,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:49:30,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:49:30,568 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:49:30,569 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 (5)] Waiting until timeout for monitored process [2024-10-12 23:49:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:49:31,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 23:49:31,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:49:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-12 23:49:33,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:49:33,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:49:33,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350873788] [2024-10-12 23:49:33,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350873788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:49:33,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:49:33,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:49:33,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859461245] [2024-10-12 23:49:33,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:49:33,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:49:33,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:49:33,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:49:33,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:49:33,908 INFO L87 Difference]: Start difference. First operand 105 states and 162 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-12 23:49:35,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []