./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_fillercode_fillercodesize_normal_file-4.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_fillercode_fillercodesize_normal_file-4.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 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:24:01,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:24:01,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:24:01,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:24:01,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:24:01,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:24:01,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:24:01,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:24:01,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:24:01,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:24:01,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:24:01,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:24:01,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:24:01,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:24:01,636 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:24:01,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:24:01,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:24:01,636 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:24:01,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:24:01,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:24:01,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:24:01,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:24:01,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:24:01,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:24:01,640 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:24:01,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:24:01,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:24:01,641 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:24:01,641 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:24:01,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:24:01,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:24:01,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:24:01,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:24:01,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:24:01,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:24:01,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:24:01,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:24:01,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:24:01,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:24:01,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:24:01,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:24:01,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:24:01,646 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 -> 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d [2024-10-13 00:24:01,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:24:01,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:24:01,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:24:01,929 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:24:01,929 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:24:01,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.i [2024-10-13 00:24:03,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:24:03,827 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:24:03,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.i [2024-10-13 00:24:03,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6586d06e1/96395d34521d44369f91e485574434f9/FLAG6c6d5850d [2024-10-13 00:24:04,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6586d06e1/96395d34521d44369f91e485574434f9 [2024-10-13 00:24:04,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:24:04,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:24:04,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:24:04,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:24:04,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:24:04,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161b78df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04, skipping insertion in model container [2024-10-13 00:24:04,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:24:04,413 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_fillercode_fillercodesize_normal_file-4.i[912,925] [2024-10-13 00:24:04,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:24:04,522 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:24:04,540 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_fillercode_fillercodesize_normal_file-4.i[912,925] [2024-10-13 00:24:04,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:24:04,612 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:24:04,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04 WrapperNode [2024-10-13 00:24:04,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:24:04,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:24:04,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:24:04,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:24:04,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,693 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-10-13 00:24:04,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:24:04,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:24:04,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:24:04,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:24:04,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,748 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-13 00:24:04,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:24:04,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:24:04,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:24:04,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:24:04,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04" (1/1) ... [2024-10-13 00:24:04,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:24:04,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:24:04,821 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-13 00:24:04,826 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-13 00:24:04,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:24:04,879 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:24:04,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:24:04,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:24:04,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:24:04,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:24:04,971 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:24:04,977 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:24:05,326 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 00:24:05,329 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:24:05,397 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:24:05,398 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:24:05,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:24:05 BoogieIcfgContainer [2024-10-13 00:24:05,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:24:05,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:24:05,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:24:05,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:24:05,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:24:04" (1/3) ... [2024-10-13 00:24:05,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23054f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:24:05, skipping insertion in model container [2024-10-13 00:24:05,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:04" (2/3) ... [2024-10-13 00:24:05,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23054f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:24:05, skipping insertion in model container [2024-10-13 00:24:05,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:24:05" (3/3) ... [2024-10-13 00:24:05,408 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-4.i [2024-10-13 00:24:05,428 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:24:05,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:24:05,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:24:05,497 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;@3165b894, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:24:05,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:24:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 00:24:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 00:24:05,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:05,518 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:05,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:05,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash -279030631, now seen corresponding path program 1 times [2024-10-13 00:24:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:24:05,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356539919] [2024-10-13 00:24:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:05,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:24:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:24:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:24:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:24:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:24:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:24:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:24:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:24:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:24:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:24:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:24:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:24:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:24:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:24:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:24:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:24:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:24:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:24:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:24:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:24:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:24:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:24:05,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:24:05,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356539919] [2024-10-13 00:24:05,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356539919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:24:05,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:24:05,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:24:05,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393378857] [2024-10-13 00:24:05,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:24:05,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:24:05,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:24:05,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:24:05,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:24:05,999 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 00:24:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:06,036 INFO L93 Difference]: Finished difference Result 113 states and 200 transitions. [2024-10-13 00:24:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:24:06,039 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-10-13 00:24:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:06,062 INFO L225 Difference]: With dead ends: 113 [2024-10-13 00:24:06,065 INFO L226 Difference]: Without dead ends: 56 [2024-10-13 00:24:06,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-13 00:24:06,077 INFO L432 NwaCegarLoop]: 82 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, 82 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-13 00:24:06,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:24:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-13 00:24:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-13 00:24:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 00:24:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2024-10-13 00:24:06,181 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 125 [2024-10-13 00:24:06,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:06,181 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2024-10-13 00:24:06,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 00:24:06,182 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2024-10-13 00:24:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 00:24:06,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:06,188 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:06,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:24:06,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:06,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:06,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1621605454, now seen corresponding path program 1 times [2024-10-13 00:24:06,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:24:06,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940465787] [2024-10-13 00:24:06,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:06,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:24:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:06,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:24:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:06,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:24:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:06,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:24:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:06,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:24:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:06,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:24:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:06,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:24:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:06,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:24:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:06,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:24:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:24:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:06,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:24:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:06,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:24:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:06,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:24:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:07,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:24:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:07,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:24:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:07,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:24:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:07,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:24:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:07,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:24:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:07,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:24:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:07,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:24:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:07,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:24:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:24:07,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:24:07,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940465787] [2024-10-13 00:24:07,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940465787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:24:07,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:24:07,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:24:07,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486534201] [2024-10-13 00:24:07,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:24:07,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:24:07,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:24:07,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:24:07,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:24:07,101 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:07,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:07,233 INFO L93 Difference]: Finished difference Result 166 states and 253 transitions. [2024-10-13 00:24:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:24:07,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-13 00:24:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:07,237 INFO L225 Difference]: With dead ends: 166 [2024-10-13 00:24:07,238 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 00:24:07,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-13 00:24:07,246 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 46 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:07,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 162 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:24:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 00:24:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-10-13 00:24:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 66 states have internal predecessors, (87), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 00:24:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2024-10-13 00:24:07,341 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 126 [2024-10-13 00:24:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:07,342 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2024-10-13 00:24:07,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2024-10-13 00:24:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 00:24:07,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:07,346 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:07,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:24:07,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:07,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:07,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1972297264, now seen corresponding path program 1 times [2024-10-13 00:24:07,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:24:07,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496994600] [2024-10-13 00:24:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:24:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:24:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:24:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:24:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:24:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:24:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:24:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:24:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:24:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:24:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:24:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:24:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:24:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:24:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:24:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:24:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:24:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:24:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:24:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:24:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:24:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:24:08,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:24:08,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496994600] [2024-10-13 00:24:08,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496994600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:24:08,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:24:08,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:24:08,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712482119] [2024-10-13 00:24:08,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:24:08,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:24:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:24:08,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:24:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:24:08,239 INFO L87 Difference]: Start difference. First operand 109 states and 167 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:08,571 INFO L93 Difference]: Finished difference Result 348 states and 527 transitions. [2024-10-13 00:24:08,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 00:24:08,572 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-13 00:24:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:08,576 INFO L225 Difference]: With dead ends: 348 [2024-10-13 00:24:08,576 INFO L226 Difference]: Without dead ends: 240 [2024-10-13 00:24:08,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:24:08,578 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 108 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:08,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 411 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 00:24:08,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-13 00:24:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 218. [2024-10-13 00:24:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 133 states have (on average 1.2932330827067668) internal successors, (172), 133 states have internal predecessors, (172), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 00:24:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 332 transitions. [2024-10-13 00:24:08,636 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 332 transitions. Word has length 126 [2024-10-13 00:24:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:08,636 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 332 transitions. [2024-10-13 00:24:08,637 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 332 transitions. [2024-10-13 00:24:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 00:24:08,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:08,640 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:08,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:24:08,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:08,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:08,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1972356846, now seen corresponding path program 1 times [2024-10-13 00:24:08,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:24:08,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798289676] [2024-10-13 00:24:08,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:08,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:24:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:24:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:24:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:24:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:24:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:24:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:24:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:24:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:24:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:24:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:24:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:24:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:24:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:24:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:24:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:24:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:24:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:24:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:24:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:24:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:24:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:24:13,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:24:13,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798289676] [2024-10-13 00:24:13,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798289676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:24:13,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:24:13,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 00:24:13,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158578548] [2024-10-13 00:24:13,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:24:13,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 00:24:13,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:24:13,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 00:24:13,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:24:13,889 INFO L87 Difference]: Start difference. First operand 218 states and 332 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:14,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:14,920 INFO L93 Difference]: Finished difference Result 602 states and 900 transitions. [2024-10-13 00:24:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 00:24:14,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-13 00:24:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:14,926 INFO L225 Difference]: With dead ends: 602 [2024-10-13 00:24:14,926 INFO L226 Difference]: Without dead ends: 385 [2024-10-13 00:24:14,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-13 00:24:14,933 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 144 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:14,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 378 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 00:24:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-13 00:24:14,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 292. [2024-10-13 00:24:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 185 states have (on average 1.281081081081081) internal successors, (237), 185 states have internal predecessors, (237), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-13 00:24:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 437 transitions. [2024-10-13 00:24:15,001 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 437 transitions. Word has length 126 [2024-10-13 00:24:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:15,003 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 437 transitions. [2024-10-13 00:24:15,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 437 transitions. [2024-10-13 00:24:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 00:24:15,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:15,033 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:15,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 00:24:15,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:15,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash -55763085, now seen corresponding path program 1 times [2024-10-13 00:24:15,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:24:15,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575733525] [2024-10-13 00:24:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:24:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:24:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:24:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:24:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:24:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:24:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:24:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:24:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:24:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:24:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:24:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:24:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:24:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:24:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:24:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:24:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:24:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:24:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:24:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:24:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:24:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:24:15,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:24:15,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575733525] [2024-10-13 00:24:15,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575733525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:24:15,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:24:15,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:24:15,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180560695] [2024-10-13 00:24:15,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:24:15,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:24:15,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:24:15,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:24:15,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:24:15,337 INFO L87 Difference]: Start difference. First operand 292 states and 437 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:15,513 INFO L93 Difference]: Finished difference Result 511 states and 771 transitions. [2024-10-13 00:24:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:24:15,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-13 00:24:15,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:15,517 INFO L225 Difference]: With dead ends: 511 [2024-10-13 00:24:15,517 INFO L226 Difference]: Without dead ends: 399 [2024-10-13 00:24:15,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:24:15,519 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 68 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:15,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 236 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:24:15,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-13 00:24:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 288. [2024-10-13 00:24:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 181 states have (on average 1.276243093922652) internal successors, (231), 181 states have internal predecessors, (231), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-13 00:24:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 431 transitions. [2024-10-13 00:24:15,562 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 431 transitions. Word has length 127 [2024-10-13 00:24:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:15,563 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 431 transitions. [2024-10-13 00:24:15,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:15,563 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 431 transitions. [2024-10-13 00:24:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 00:24:15,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:15,565 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:15,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 00:24:15,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:15,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash -756827663, now seen corresponding path program 1 times [2024-10-13 00:24:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:24:15,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565203969] [2024-10-13 00:24:15,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:15,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:24:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:24:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:24:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:24:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:24:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:24:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:24:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:24:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:24:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:24:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:24:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:24:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:24:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:24:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:24:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:24:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:24:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:24:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:24:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:24:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:24:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 00:24:15,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:24:15,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565203969] [2024-10-13 00:24:15,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565203969] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:24:15,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075230548] [2024-10-13 00:24:15,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:15,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:24:15,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:24:15,859 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-13 00:24:15,861 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-13 00:24:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:15,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 00:24:15,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:24:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-10-13 00:24:16,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:24:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 00:24:16,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075230548] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:24:16,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 00:24:16,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 00:24:16,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992043076] [2024-10-13 00:24:16,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 00:24:16,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 00:24:16,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:24:16,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 00:24:16,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:24:16,469 INFO L87 Difference]: Start difference. First operand 288 states and 431 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-13 00:24:16,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:16,658 INFO L93 Difference]: Finished difference Result 539 states and 783 transitions. [2024-10-13 00:24:16,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 00:24:16,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 127 [2024-10-13 00:24:16,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:16,661 INFO L225 Difference]: With dead ends: 539 [2024-10-13 00:24:16,662 INFO L226 Difference]: Without dead ends: 317 [2024-10-13 00:24:16,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 00:24:16,664 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 52 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:16,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 114 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:24:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-13 00:24:16,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 281. [2024-10-13 00:24:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 169 states have (on average 1.1420118343195267) internal successors, (193), 169 states have internal predecessors, (193), 100 states have call successors, (100), 11 states have call predecessors, (100), 11 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-13 00:24:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 393 transitions. [2024-10-13 00:24:16,702 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 393 transitions. Word has length 127 [2024-10-13 00:24:16,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:16,702 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 393 transitions. [2024-10-13 00:24:16,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-13 00:24:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 393 transitions. [2024-10-13 00:24:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 00:24:16,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:16,704 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:16,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 00:24:16,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 00:24:16,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:16,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:16,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1170964856, now seen corresponding path program 1 times [2024-10-13 00:24:16,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:24:16,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021549059] [2024-10-13 00:24:16,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:16,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:24:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:24:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:24:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:24:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:24:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:24:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:24:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:24:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:24:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:24:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:24:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:24:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:24:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:24:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:24:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:24:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:24:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:24:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:24:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:24:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:24:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:24:17,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:24:17,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021549059] [2024-10-13 00:24:17,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021549059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:24:17,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:24:17,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:24:17,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52909011] [2024-10-13 00:24:17,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:24:17,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:24:17,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:24:17,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:24:17,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:24:17,384 INFO L87 Difference]: Start difference. First operand 281 states and 393 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:17,617 INFO L93 Difference]: Finished difference Result 412 states and 576 transitions. [2024-10-13 00:24:17,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:24:17,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-13 00:24:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:17,620 INFO L225 Difference]: With dead ends: 412 [2024-10-13 00:24:17,620 INFO L226 Difference]: Without dead ends: 188 [2024-10-13 00:24:17,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:24:17,622 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 41 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:17,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 244 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 00:24:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-13 00:24:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2024-10-13 00:24:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 102 states have (on average 1.1372549019607843) internal successors, (116), 102 states have internal predecessors, (116), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 00:24:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 236 transitions. [2024-10-13 00:24:17,650 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 236 transitions. Word has length 127 [2024-10-13 00:24:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:17,650 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 236 transitions. [2024-10-13 00:24:17,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 236 transitions. [2024-10-13 00:24:17,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 00:24:17,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:17,652 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:17,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 00:24:17,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:17,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:17,652 INFO L85 PathProgramCache]: Analyzing trace with hash 912799418, now seen corresponding path program 1 times [2024-10-13 00:24:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:24:17,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493554499] [2024-10-13 00:24:17,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:17,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:24:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:24:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:24:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:24:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:24:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:24:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:24:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:24:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:24:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:17,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:24:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:18,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:24:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:18,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:24:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:18,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:24:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:24:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:18,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:24:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:18,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:24:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:18,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:24:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:18,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:24:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:18,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:24:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:24:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:18,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:24:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 00:24:18,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:24:18,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493554499] [2024-10-13 00:24:18,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493554499] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:24:18,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113410038] [2024-10-13 00:24:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:18,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:24:18,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:24:18,049 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-13 00:24:18,052 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-13 00:24:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:18,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 00:24:18,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:24:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-10-13 00:24:18,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:24:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 00:24:18,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113410038] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:24:18,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 00:24:18,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-10-13 00:24:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943680359] [2024-10-13 00:24:18,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 00:24:18,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 00:24:18,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:24:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 00:24:18,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:24:18,700 INFO L87 Difference]: Start difference. First operand 170 states and 236 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-13 00:24:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:19,292 INFO L93 Difference]: Finished difference Result 315 states and 426 transitions. [2024-10-13 00:24:19,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 00:24:19,292 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 127 [2024-10-13 00:24:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:19,294 INFO L225 Difference]: With dead ends: 315 [2024-10-13 00:24:19,294 INFO L226 Difference]: Without dead ends: 202 [2024-10-13 00:24:19,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 288 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-13 00:24:19,295 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 61 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:19,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 365 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 00:24:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-13 00:24:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 176. [2024-10-13 00:24:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 106 states have (on average 1.1226415094339623) internal successors, (119), 106 states have internal predecessors, (119), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 00:24:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 239 transitions. [2024-10-13 00:24:19,327 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 239 transitions. Word has length 127 [2024-10-13 00:24:19,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:19,328 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 239 transitions. [2024-10-13 00:24:19,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-13 00:24:19,329 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 239 transitions. [2024-10-13 00:24:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 00:24:19,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:19,330 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:19,348 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-13 00:24:19,530 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,SelfDestructingSolverStorable7 [2024-10-13 00:24:19,532 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:19,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:19,532 INFO L85 PathProgramCache]: Analyzing trace with hash 912859000, now seen corresponding path program 1 times [2024-10-13 00:24:19,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:24:19,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997466740] [2024-10-13 00:24:19,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:19,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:24:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:24:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:24:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:24:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:24:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:24:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:24:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:24:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:24:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:24:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:24:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:24:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:24:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:24:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:24:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:24:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:24:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:24:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:24:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:24:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:24:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:24:19,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:24:19,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997466740] [2024-10-13 00:24:19,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997466740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:24:19,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:24:19,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:24:19,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680501234] [2024-10-13 00:24:19,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:24:19,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:24:19,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:24:19,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:24:19,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:24:19,701 INFO L87 Difference]: Start difference. First operand 176 states and 239 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:19,750 INFO L93 Difference]: Finished difference Result 360 states and 490 transitions. [2024-10-13 00:24:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:24:19,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-13 00:24:19,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:19,755 INFO L225 Difference]: With dead ends: 360 [2024-10-13 00:24:19,756 INFO L226 Difference]: Without dead ends: 237 [2024-10-13 00:24:19,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-13 00:24:19,757 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 70 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:19,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 155 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:24:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-13 00:24:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2024-10-13 00:24:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 142 states have (on average 1.1267605633802817) internal successors, (160), 142 states have internal predecessors, (160), 80 states have call successors, (80), 12 states have call predecessors, (80), 12 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-13 00:24:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 320 transitions. [2024-10-13 00:24:19,791 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 320 transitions. Word has length 127 [2024-10-13 00:24:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:19,792 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 320 transitions. [2024-10-13 00:24:19,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:19,792 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 320 transitions. [2024-10-13 00:24:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 00:24:19,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:19,795 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:19,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 00:24:19,795 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:19,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:19,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2018242555, now seen corresponding path program 1 times [2024-10-13 00:24:19,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:24:19,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267178691] [2024-10-13 00:24:19,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:19,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:24:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:24:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:24:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:24:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:24:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:24:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:24:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:24:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:19,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:24:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:20,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:24:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:20,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:24:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:20,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:24:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:20,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:24:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:20,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:24:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:20,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:24:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:20,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:24:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:20,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:24:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:20,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:24:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:20,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:24:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:20,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:24:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:20,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:24:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:24:20,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:24:20,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267178691] [2024-10-13 00:24:20,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267178691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:24:20,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:24:20,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:24:20,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858791935] [2024-10-13 00:24:20,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:24:20,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:24:20,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:24:20,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:24:20,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:24:20,022 INFO L87 Difference]: Start difference. First operand 235 states and 320 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:20,201 INFO L93 Difference]: Finished difference Result 529 states and 722 transitions. [2024-10-13 00:24:20,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:24:20,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-13 00:24:20,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:20,205 INFO L225 Difference]: With dead ends: 529 [2024-10-13 00:24:20,205 INFO L226 Difference]: Without dead ends: 351 [2024-10-13 00:24:20,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:24:20,206 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 82 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:20,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 281 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:24:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-13 00:24:20,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 347. [2024-10-13 00:24:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 208 states have (on average 1.1153846153846154) internal successors, (232), 208 states have internal predecessors, (232), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-13 00:24:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 472 transitions. [2024-10-13 00:24:20,243 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 472 transitions. Word has length 127 [2024-10-13 00:24:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:20,244 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 472 transitions. [2024-10-13 00:24:20,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 472 transitions. [2024-10-13 00:24:20,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 00:24:20,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:20,245 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:20,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 00:24:20,245 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:20,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1208895929, now seen corresponding path program 1 times [2024-10-13 00:24:20,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:24:20,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630107792] [2024-10-13 00:24:20,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:20,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:24:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:24:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:24:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:24:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:24:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:24:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:24:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:24:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:24:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:24:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:24:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:24:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:24:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:24:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:24:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:24:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:24:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:24:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:24:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:24:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:24:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 24 proven. 33 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 00:24:21,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:24:21,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630107792] [2024-10-13 00:24:21,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630107792] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:24:21,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147814024] [2024-10-13 00:24:21,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:21,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:24:21,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:24:21,269 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:24:21,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 00:24:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:21,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 00:24:21,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:24:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 400 proven. 60 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-13 00:24:22,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:24:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 63 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-10-13 00:24:23,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147814024] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:24:23,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 00:24:23,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 26 [2024-10-13 00:24:23,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062990881] [2024-10-13 00:24:23,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 00:24:23,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 00:24:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:24:23,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 00:24:23,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2024-10-13 00:24:23,526 INFO L87 Difference]: Start difference. First operand 347 states and 472 transitions. Second operand has 26 states, 25 states have (on average 3.4) internal successors, (85), 24 states have internal predecessors, (85), 8 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-10-13 00:24:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:25,274 INFO L93 Difference]: Finished difference Result 473 states and 622 transitions. [2024-10-13 00:24:25,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 00:24:25,275 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.4) internal successors, (85), 24 states have internal predecessors, (85), 8 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) Word has length 127 [2024-10-13 00:24:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:25,277 INFO L225 Difference]: With dead ends: 473 [2024-10-13 00:24:25,277 INFO L226 Difference]: Without dead ends: 175 [2024-10-13 00:24:25,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=713, Invalid=1837, Unknown=0, NotChecked=0, Total=2550 [2024-10-13 00:24:25,280 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 415 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:25,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 351 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 00:24:25,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-13 00:24:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 125. [2024-10-13 00:24:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 00:24:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2024-10-13 00:24:25,310 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 127 [2024-10-13 00:24:25,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:25,311 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2024-10-13 00:24:25,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.4) internal successors, (85), 24 states have internal predecessors, (85), 8 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-10-13 00:24:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2024-10-13 00:24:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 00:24:25,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:25,313 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:25,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 00:24:25,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:24:25,520 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:25,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:25,521 INFO L85 PathProgramCache]: Analyzing trace with hash -761419599, now seen corresponding path program 1 times [2024-10-13 00:24:25,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:24:25,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132471639] [2024-10-13 00:24:25,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:25,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:24:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 00:24:25,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1781562874] [2024-10-13 00:24:25,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:25,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:24:25,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:24:25,657 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:24:25,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 00:24:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:24:25,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:24:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:24:25,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:24:25,948 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:24:25,950 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:24:25,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 00:24:26,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:24:26,156 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:24:26,276 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:24:26,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:24:26 BoogieIcfgContainer [2024-10-13 00:24:26,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:24:26,281 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:24:26,281 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:24:26,281 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:24:26,282 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:24:05" (3/4) ... [2024-10-13 00:24:26,284 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:24:26,285 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:24:26,286 INFO L158 Benchmark]: Toolchain (without parser) took 22090.72ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 100.7MB in the beginning and 224.7MB in the end (delta: -124.0MB). Peak memory consumption was 229.8MB. Max. memory is 16.1GB. [2024-10-13 00:24:26,286 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 172.0MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:24:26,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.11ms. Allocated memory is still 172.0MB. Free memory was 100.5MB in the beginning and 85.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 00:24:26,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.58ms. Allocated memory is still 172.0MB. Free memory was 85.2MB in the beginning and 140.4MB in the end (delta: -55.2MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-13 00:24:26,287 INFO L158 Benchmark]: Boogie Preprocessor took 76.46ms. Allocated memory is still 172.0MB. Free memory was 140.4MB in the beginning and 139.8MB in the end (delta: 573.5kB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-10-13 00:24:26,287 INFO L158 Benchmark]: RCFGBuilder took 627.45ms. Allocated memory is still 172.0MB. Free memory was 139.8MB in the beginning and 113.6MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 00:24:26,287 INFO L158 Benchmark]: TraceAbstraction took 20879.60ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 113.6MB in the beginning and 224.7MB in the end (delta: -111.2MB). Peak memory consumption was 241.2MB. Max. memory is 16.1GB. [2024-10-13 00:24:26,288 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 522.2MB. Free memory is still 224.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:24:26,290 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.12ms. Allocated memory is still 172.0MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.11ms. Allocated memory is still 172.0MB. Free memory was 100.5MB in the beginning and 85.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.58ms. Allocated memory is still 172.0MB. Free memory was 85.2MB in the beginning and 140.4MB in the end (delta: -55.2MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.46ms. Allocated memory is still 172.0MB. Free memory was 140.4MB in the beginning and 139.8MB in the end (delta: 573.5kB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * RCFGBuilder took 627.45ms. Allocated memory is still 172.0MB. Free memory was 139.8MB in the beginning and 113.6MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 20879.60ms. Allocated memory was 172.0MB in the beginning and 522.2MB in the end (delta: 350.2MB). Free memory was 113.6MB in the beginning and 224.7MB in the end (delta: -111.2MB). Peak memory consumption was 241.2MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 522.2MB. Free memory is still 224.7MB. 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 131, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] unsigned short int last_1_var_1_6 = 4; [L40] unsigned short int last_1_var_1_9 = 4; [L41] unsigned long int last_1_var_1_14 = 500; [L42] signed short int last_1_var_1_17 = 16; [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L125] last_1_var_1_6 = var_1_6 [L126] last_1_var_1_9 = var_1_9 [L127] last_1_var_1_14 = var_1_14 [L128] last_1_var_1_17 = var_1_17 [L138] RET updateLastVariables() [L139] CALL updateVariables() [L92] var_1_4 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L93] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L94] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L94] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L95] var_1_5 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L96] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L97] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L98] var_1_10 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L101] var_1_12 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L102] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L103] var_1_13 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L104] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L105] var_1_15 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L106] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L108] var_1_16 = __VERIFIER_nondet_ulong() [L109] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L109] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L111] var_1_19 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L112] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L114] var_1_20 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L115] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L117] var_1_21 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L118] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] var_1_22 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] RET updateVariables() [L140] CALL step() [L46] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L47] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L52] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L53] COND TRUE last_1_var_1_14 >= stepLocal_3 [L54] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L56] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L57] COND TRUE (- var_1_14) > var_1_6 [L58] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L63] unsigned char stepLocal_2 = var_1_4; [L64] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=8589934574, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L65] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=8589934574, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] COND TRUE stepLocal_1 >= var_1_6 [L69] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L74] unsigned char stepLocal_5 = var_1_1; [L75] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L76] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L83] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L84] COND TRUE ! var_1_1 [L85] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.7s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1091 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1087 mSDsluCounter, 2779 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1789 mSDsCounter, 665 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1986 IncrementalHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 665 mSolverCounterUnsat, 990 mSDtfsCounter, 1986 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1336 GetRequests, 1225 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=10, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 364 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 2029 NumberOfCodeBlocks, 2029 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2137 ConstructedInterpolants, 0 QuantifiedInterpolants, 10710 SizeOfPredicates, 17 NumberOfNonLiveVariables, 909 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 12458/12920 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-13 00:24:26,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercode_fillercodesize_normal_file-4.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 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:24:28,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:24:28,814 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:24:28,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:24:28,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:24:28,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:24:28,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:24:28,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:24:28,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:24:28,862 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:24:28,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:24:28,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:24:28,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:24:28,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:24:28,865 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:24:28,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:24:28,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:24:28,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:24:28,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:24:28,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:24:28,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:24:28,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:24:28,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:24:28,871 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:24:28,871 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:24:28,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:24:28,872 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:24:28,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:24:28,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:24:28,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:24:28,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:24:28,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:24:28,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:24:28,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:24:28,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:24:28,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:24:28,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:24:28,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:24:28,876 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:24:28,877 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:24:28,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:24:28,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:24:28,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:24:28,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:24:28,878 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:24:28,878 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 -> 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d [2024-10-13 00:24:29,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:24:29,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:24:29,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:24:29,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:24:29,251 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:24:29,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.i [2024-10-13 00:24:30,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:24:31,175 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:24:31,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.i [2024-10-13 00:24:31,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a72181e/964ffb666b454a918d37dc21e96d4812/FLAG5f2904ed0 [2024-10-13 00:24:31,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a72181e/964ffb666b454a918d37dc21e96d4812 [2024-10-13 00:24:31,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:24:31,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:24:31,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:24:31,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:24:31,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:24:31,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:31,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e735639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31, skipping insertion in model container [2024-10-13 00:24:31,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:31,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:24:31,781 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_fillercode_fillercodesize_normal_file-4.i[912,925] [2024-10-13 00:24:31,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:24:31,881 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:24:31,894 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_fillercode_fillercodesize_normal_file-4.i[912,925] [2024-10-13 00:24:31,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:24:31,994 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:24:31,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31 WrapperNode [2024-10-13 00:24:31,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:24:31,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:24:31,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:24:31,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:24:32,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:32,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:32,052 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-10-13 00:24:32,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:24:32,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:24:32,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:24:32,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:24:32,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:32,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:32,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:32,090 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-13 00:24:32,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:32,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:32,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:32,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:32,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:32,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:32,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:24:32,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:24:32,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:24:32,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:24:32,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31" (1/1) ... [2024-10-13 00:24:32,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:24:32,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:24:32,173 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-13 00:24:32,176 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-13 00:24:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:24:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:24:32,226 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:24:32,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:24:32,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:24:32,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:24:32,313 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:24:32,315 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:24:33,004 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 00:24:33,004 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:24:33,067 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:24:33,067 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:24:33,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:24:33 BoogieIcfgContainer [2024-10-13 00:24:33,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:24:33,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:24:33,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:24:33,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:24:33,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:24:31" (1/3) ... [2024-10-13 00:24:33,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f46d3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:24:33, skipping insertion in model container [2024-10-13 00:24:33,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:24:31" (2/3) ... [2024-10-13 00:24:33,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f46d3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:24:33, skipping insertion in model container [2024-10-13 00:24:33,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:24:33" (3/3) ... [2024-10-13 00:24:33,082 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-4.i [2024-10-13 00:24:33,099 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:24:33,100 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:24:33,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:24:33,176 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;@6ea613a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:24:33,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:24:33,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 00:24:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 00:24:33,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:33,195 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:33,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:33,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:33,201 INFO L85 PathProgramCache]: Analyzing trace with hash -279030631, now seen corresponding path program 1 times [2024-10-13 00:24:33,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:24:33,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908932733] [2024-10-13 00:24:33,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:33,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:24:33,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:24:33,218 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-13 00:24:33,219 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-13 00:24:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:33,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:24:33,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:24:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-10-13 00:24:33,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:24:33,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:24:33,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908932733] [2024-10-13 00:24:33,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908932733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:24:33,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:24:33,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:24:33,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117316538] [2024-10-13 00:24:33,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:24:33,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:24:33,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:24:33,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:24:33,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:24:33,601 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:33,959 INFO L93 Difference]: Finished difference Result 113 states and 200 transitions. [2024-10-13 00:24:33,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:24:33,979 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-10-13 00:24:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:33,988 INFO L225 Difference]: With dead ends: 113 [2024-10-13 00:24:33,989 INFO L226 Difference]: Without dead ends: 56 [2024-10-13 00:24:33,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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-13 00:24:33,998 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 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.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:33,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:24:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-13 00:24:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-13 00:24:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 00:24:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2024-10-13 00:24:34,044 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 125 [2024-10-13 00:24:34,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:34,045 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2024-10-13 00:24:34,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:34,046 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2024-10-13 00:24:34,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 00:24:34,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:34,051 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:34,063 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-13 00:24:34,251 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-13 00:24:34,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:34,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:34,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1621605454, now seen corresponding path program 1 times [2024-10-13 00:24:34,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:24:34,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74655583] [2024-10-13 00:24:34,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:34,254 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-13 00:24:34,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:24:34,259 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-13 00:24:34,260 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-13 00:24:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:34,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 00:24:34,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:24:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:24:35,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:24:35,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:24:35,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74655583] [2024-10-13 00:24:35,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74655583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:24:35,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:24:35,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:24:35,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022664754] [2024-10-13 00:24:35,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:24:35,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:24:35,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:24:35,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:24:35,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:24:35,537 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:36,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:36,963 INFO L93 Difference]: Finished difference Result 167 states and 254 transitions. [2024-10-13 00:24:36,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:24:36,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-13 00:24:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:36,983 INFO L225 Difference]: With dead ends: 167 [2024-10-13 00:24:36,983 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 00:24:36,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:24:36,988 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:36,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 259 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 00:24:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 00:24:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2024-10-13 00:24:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 00:24:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-10-13 00:24:37,041 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 126 [2024-10-13 00:24:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:37,044 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-10-13 00:24:37,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-10-13 00:24:37,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 00:24:37,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:37,046 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:37,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 00:24:37,247 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-13 00:24:37,248 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:37,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1972297264, now seen corresponding path program 1 times [2024-10-13 00:24:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:24:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104596385] [2024-10-13 00:24:37,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:37,250 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-13 00:24:37,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:24:37,253 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-13 00:24:37,254 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-13 00:24:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:37,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 00:24:37,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:24:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 179 proven. 99 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-10-13 00:24:38,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:24:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 102 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-10-13 00:24:38,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:24:38,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104596385] [2024-10-13 00:24:38,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104596385] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:24:38,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:24:38,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-10-13 00:24:38,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108962442] [2024-10-13 00:24:38,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:24:38,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 00:24:38,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:24:38,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 00:24:38,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-13 00:24:38,666 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-13 00:24:40,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:40,378 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2024-10-13 00:24:40,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 00:24:40,385 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 126 [2024-10-13 00:24:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:40,387 INFO L225 Difference]: With dead ends: 191 [2024-10-13 00:24:40,387 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 00:24:40,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-10-13 00:24:40,389 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 44 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:40,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 240 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 00:24:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 00:24:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2024-10-13 00:24:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 00:24:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 155 transitions. [2024-10-13 00:24:40,408 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 155 transitions. Word has length 126 [2024-10-13 00:24:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:40,409 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 155 transitions. [2024-10-13 00:24:40,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-13 00:24:40,410 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 155 transitions. [2024-10-13 00:24:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 00:24:40,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:40,411 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:40,425 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 (4)] Ended with exit code 0 [2024-10-13 00:24:40,612 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-13 00:24:40,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:40,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:40,613 INFO L85 PathProgramCache]: Analyzing trace with hash 519772408, now seen corresponding path program 1 times [2024-10-13 00:24:40,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:24:40,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013745339] [2024-10-13 00:24:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:40,614 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-13 00:24:40,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:24:40,616 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-13 00:24:40,617 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-13 00:24:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:40,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 00:24:40,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:24:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-10-13 00:24:41,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:24:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 00:24:41,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:24:41,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013745339] [2024-10-13 00:24:41,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013745339] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:24:41,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:24:41,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-10-13 00:24:41,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137536396] [2024-10-13 00:24:41,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:24:41,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:24:41,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:24:41,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:24:41,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:24:41,386 INFO L87 Difference]: Start difference. First operand 115 states and 155 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-13 00:24:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:43,156 INFO L93 Difference]: Finished difference Result 256 states and 340 transitions. [2024-10-13 00:24:43,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 00:24:43,157 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 127 [2024-10-13 00:24:43,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:43,164 INFO L225 Difference]: With dead ends: 256 [2024-10-13 00:24:43,165 INFO L226 Difference]: Without dead ends: 189 [2024-10-13 00:24:43,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-10-13 00:24:43,167 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 87 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:43,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 315 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 00:24:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-13 00:24:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2024-10-13 00:24:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 99 states have (on average 1.101010101010101) internal successors, (109), 99 states have internal predecessors, (109), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 00:24:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 229 transitions. [2024-10-13 00:24:43,197 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 229 transitions. Word has length 127 [2024-10-13 00:24:43,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:43,197 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 229 transitions. [2024-10-13 00:24:43,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-13 00:24:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 229 transitions. [2024-10-13 00:24:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 00:24:43,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:43,199 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:43,211 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 (5)] Forceful destruction successful, exit code 0 [2024-10-13 00:24:43,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-13 00:24:43,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:43,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:43,405 INFO L85 PathProgramCache]: Analyzing trace with hash 519831990, now seen corresponding path program 1 times [2024-10-13 00:24:43,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:24:43,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58978348] [2024-10-13 00:24:43,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:43,406 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-13 00:24:43,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:24:43,407 INFO L229 MonitoredProcess]: Starting monitored process 6 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-13 00:24:43,408 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 (6)] Waiting until timeout for monitored process [2024-10-13 00:24:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:43,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 00:24:43,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:24:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-10-13 00:24:44,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:24:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 00:24:44,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:24:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58978348] [2024-10-13 00:24:44,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58978348] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:24:44,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:24:44,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2024-10-13 00:24:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278090139] [2024-10-13 00:24:44,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:24:44,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:24:44,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:24:44,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:24:44,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:24:44,537 INFO L87 Difference]: Start difference. First operand 169 states and 229 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 00:24:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:45,867 INFO L93 Difference]: Finished difference Result 257 states and 340 transitions. [2024-10-13 00:24:45,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 00:24:45,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 127 [2024-10-13 00:24:45,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:45,895 INFO L225 Difference]: With dead ends: 257 [2024-10-13 00:24:45,895 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 00:24:45,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-10-13 00:24:45,897 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 42 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:45,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 167 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 00:24:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 00:24:45,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2024-10-13 00:24:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 00:24:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2024-10-13 00:24:45,913 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 127 [2024-10-13 00:24:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:45,914 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2024-10-13 00:24:45,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-13 00:24:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2024-10-13 00:24:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 00:24:45,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:45,917 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:45,934 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 (6)] Ended with exit code 0 [2024-10-13 00:24:46,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-13 00:24:46,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:46,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2018242555, now seen corresponding path program 1 times [2024-10-13 00:24:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:24:46,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602538750] [2024-10-13 00:24:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:46,120 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-13 00:24:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:24:46,121 INFO L229 MonitoredProcess]: Starting monitored process 7 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-13 00:24:46,123 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 (7)] Waiting until timeout for monitored process [2024-10-13 00:24:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:46,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 00:24:46,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:24:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:24:46,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:24:46,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:24:46,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602538750] [2024-10-13 00:24:46,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602538750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:24:46,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:24:46,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:24:46,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270700400] [2024-10-13 00:24:46,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:24:46,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:24:46,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:24:46,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:24:46,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:24:46,621 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:47,413 INFO L93 Difference]: Finished difference Result 230 states and 309 transitions. [2024-10-13 00:24:47,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:24:47,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-13 00:24:47,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:47,415 INFO L225 Difference]: With dead ends: 230 [2024-10-13 00:24:47,415 INFO L226 Difference]: Without dead ends: 169 [2024-10-13 00:24:47,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:24:47,417 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 98 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:47,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 189 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 00:24:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-13 00:24:47,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-10-13 00:24:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 00:24:47,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 224 transitions. [2024-10-13 00:24:47,437 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 224 transitions. Word has length 127 [2024-10-13 00:24:47,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:47,437 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 224 transitions. [2024-10-13 00:24:47,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:24:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 224 transitions. [2024-10-13 00:24:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 00:24:47,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:47,439 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:47,462 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 (7)] Ended with exit code 0 [2024-10-13 00:24:47,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-13 00:24:47,640 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:47,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:47,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1208895929, now seen corresponding path program 1 times [2024-10-13 00:24:47,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:24:47,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264649688] [2024-10-13 00:24:47,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:47,641 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-13 00:24:47,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:24:47,646 INFO L229 MonitoredProcess]: Starting monitored process 8 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-13 00:24:47,650 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 (8)] Waiting until timeout for monitored process [2024-10-13 00:24:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:47,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 00:24:47,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:24:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 387 proven. 33 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-13 00:24:48,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:24:48,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:24:48,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264649688] [2024-10-13 00:24:48,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264649688] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:24:48,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [776426468] [2024-10-13 00:24:48,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:48,835 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 00:24:48,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 00:24:48,838 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 00:24:48,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-13 00:24:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:49,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 00:24:49,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:24:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 438 proven. 57 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-13 00:24:50,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:24:50,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [776426468] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:24:50,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:24:50,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-10-13 00:24:50,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15998451] [2024-10-13 00:24:50,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:24:50,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 00:24:50,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:24:50,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 00:24:50,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-13 00:24:50,814 INFO L87 Difference]: Start difference. First operand 167 states and 224 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-10-13 00:24:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:24:54,856 INFO L93 Difference]: Finished difference Result 256 states and 330 transitions. [2024-10-13 00:24:54,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 00:24:54,858 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) Word has length 127 [2024-10-13 00:24:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:24:54,860 INFO L225 Difference]: With dead ends: 256 [2024-10-13 00:24:54,860 INFO L226 Difference]: Without dead ends: 137 [2024-10-13 00:24:54,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 00:24:54,863 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 160 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:24:54,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 244 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 00:24:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-13 00:24:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2024-10-13 00:24:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 00:24:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2024-10-13 00:24:54,912 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 127 [2024-10-13 00:24:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:24:54,913 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2024-10-13 00:24:54,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-10-13 00:24:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2024-10-13 00:24:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 00:24:54,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:24:54,915 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 00:24:54,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-10-13 00:24:55,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 (8)] Ended with exit code 0 [2024-10-13 00:24:55,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /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-13 00:24:55,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:24:55,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:24:55,317 INFO L85 PathProgramCache]: Analyzing trace with hash -761419599, now seen corresponding path program 1 times [2024-10-13 00:24:55,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:24:55,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006168880] [2024-10-13 00:24:55,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:24:55,318 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-13 00:24:55,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:24:55,321 INFO L229 MonitoredProcess]: Starting monitored process 10 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-13 00:24:55,323 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 (10)] Waiting until timeout for monitored process [2024-10-13 00:24:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:24:55,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 00:24:55,545 INFO L278 TraceCheckSpWp]: Computing forward predicates...