./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_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 fb80e4f0533bc0d87718a3c946d158e7005d734d62d8e11c16c799aba4b0f82b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:52:52,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:52:52,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:52:52,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:52:52,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:52:52,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:52:52,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:52:52,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:52:52,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:52:52,339 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:52:52,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:52:52,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:52:52,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:52:52,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:52:52,343 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:52:52,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:52:52,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:52:52,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:52:52,344 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:52:52,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:52:52,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:52:52,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:52:52,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:52:52,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:52:52,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:52:52,349 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:52:52,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:52:52,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:52:52,351 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:52:52,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:52:52,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:52:52,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:52:52,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:52:52,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:52:52,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:52:52,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:52:52,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:52:52,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:52:52,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:52:52,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:52:52,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:52:52,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:52:52,357 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 -> fb80e4f0533bc0d87718a3c946d158e7005d734d62d8e11c16c799aba4b0f82b [2024-11-12 05:52:52,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:52:52,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:52:52,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:52:52,683 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:52:52,683 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:52:52,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i [2024-11-12 05:52:54,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:52:54,479 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:52:54,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i [2024-11-12 05:52:54,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b486ceaac/1128a46e41c94649a69fd5f50fea5f18/FLAGc5e5723f6 [2024-11-12 05:52:54,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b486ceaac/1128a46e41c94649a69fd5f50fea5f18 [2024-11-12 05:52:54,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:52:54,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:52:54,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:52:54,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:52:54,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:52:54,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:54,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebdfd61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54, skipping insertion in model container [2024-11-12 05:52:54,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:54,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:52:54,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i[914,927] [2024-11-12 05:52:54,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:52:54,846 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:52:54,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i[914,927] [2024-11-12 05:52:54,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:52:54,914 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:52:54,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54 WrapperNode [2024-11-12 05:52:54,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:52:54,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:52:54,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:52:54,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:52:54,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:54,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:54,984 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-12 05:52:54,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:52:54,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:52:54,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:52:54,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:52:54,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:54,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:55,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:55,037 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:52:55,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:55,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:55,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:55,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:55,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:55,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:55,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:52:55,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:52:55,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:52:55,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:52:55,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54" (1/1) ... [2024-11-12 05:52:55,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:52:55,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:52:55,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:52:55,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:52:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:52:55,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:52:55,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:52:55,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:52:55,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:52:55,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:52:55,270 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:52:55,272 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:52:55,651 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 05:52:55,652 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:52:55,670 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:52:55,670 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:52:55,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:52:55 BoogieIcfgContainer [2024-11-12 05:52:55,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:52:55,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:52:55,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:52:55,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:52:55,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:52:54" (1/3) ... [2024-11-12 05:52:55,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95dd10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:52:55, skipping insertion in model container [2024-11-12 05:52:55,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:52:54" (2/3) ... [2024-11-12 05:52:55,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95dd10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:52:55, skipping insertion in model container [2024-11-12 05:52:55,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:52:55" (3/3) ... [2024-11-12 05:52:55,680 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-4.i [2024-11-12 05:52:55,699 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:52:55,699 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:52:55,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:52:55,771 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;@25a0ecb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:52:55,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:52:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 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-11-12 05:52:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 05:52:55,787 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:52:55,788 INFO L218 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, 1] [2024-11-12 05:52:55,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:52:55,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:52:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash -246695732, now seen corresponding path program 1 times [2024-11-12 05:52:55,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:52:55,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533695209] [2024-11-12 05:52:55,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:52:55,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:52:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:52:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:52:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:52:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:52:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:52:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:52:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:52:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:52:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:52:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:52:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:52:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:52:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:52:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:52:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:52:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:52:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:52:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:52:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:52:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:52:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:52:56,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:52:56,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533695209] [2024-11-12 05:52:56,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533695209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:52:56,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:52:56,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:52:56,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774378236] [2024-11-12 05:52:56,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:52:56,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:52:56,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:52:56,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:52:56,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:52:56,351 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-11-12 05:52:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:52:56,379 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2024-11-12 05:52:56,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:52:56,381 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (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 129 [2024-11-12 05:52:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:52:56,392 INFO L225 Difference]: With dead ends: 121 [2024-11-12 05:52:56,393 INFO L226 Difference]: Without dead ends: 60 [2024-11-12 05:52:56,398 INFO L434 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-11-12 05:52:56,403 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:52:56,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:52:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-12 05:52:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-12 05:52:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 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-11-12 05:52:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-12 05:52:56,453 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2024-11-12 05:52:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:52:56,454 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-12 05:52:56,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (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-11-12 05:52:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-12 05:52:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 05:52:56,460 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:52:56,460 INFO L218 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, 1, 1] [2024-11-12 05:52:56,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:52:56,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:52:56,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:52:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash -157864659, now seen corresponding path program 1 times [2024-11-12 05:52:56,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:52:56,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296142003] [2024-11-12 05:52:56,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:52:56,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:52:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:52:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:52:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:52:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:52:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:52:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:52:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:52:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:52:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:52:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:52:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:52:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:52:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:52:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:52:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:52:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:52:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:52:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:52:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:52:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:52:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:52:57,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:52:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296142003] [2024-11-12 05:52:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296142003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:52:57,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:52:57,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:52:57,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877104932] [2024-11-12 05:52:57,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:52:57,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:52:57,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:52:57,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:52:57,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:52:57,543 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-11-12 05:52:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:52:57,643 INFO L93 Difference]: Finished difference Result 174 states and 261 transitions. [2024-11-12 05:52:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:52:57,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 130 [2024-11-12 05:52:57,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:52:57,649 INFO L225 Difference]: With dead ends: 174 [2024-11-12 05:52:57,649 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 05:52:57,650 INFO L434 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-11-12 05:52:57,652 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 47 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:52:57,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 171 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:52:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 05:52:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2024-11-12 05:52:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 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-11-12 05:52:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 173 transitions. [2024-11-12 05:52:57,709 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 173 transitions. Word has length 130 [2024-11-12 05:52:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:52:57,709 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 173 transitions. [2024-11-12 05:52:57,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-11-12 05:52:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 173 transitions. [2024-11-12 05:52:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 05:52:57,714 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:52:57,714 INFO L218 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, 1, 1] [2024-11-12 05:52:57,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:52:57,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:52:57,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:52:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash -416030097, now seen corresponding path program 1 times [2024-11-12 05:52:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:52:57,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663082427] [2024-11-12 05:52:57,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:52:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:52:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:52:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:52:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:52:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:52:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:52:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:52:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:52:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:52:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:52:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:52:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:52:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:52:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:52:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:52:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:52:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:52:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:52:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:52:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:52:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:52:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:52:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:52:58,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:52:58,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663082427] [2024-11-12 05:52:58,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663082427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:52:58,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:52:58,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:52:58,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259609382] [2024-11-12 05:52:58,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:52:58,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:52:58,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:52:58,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:52:58,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:52:58,653 INFO L87 Difference]: Start difference. First operand 115 states and 173 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-11-12 05:52:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:52:59,110 INFO L93 Difference]: Finished difference Result 367 states and 546 transitions. [2024-11-12 05:52:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:52:59,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 130 [2024-11-12 05:52:59,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:52:59,115 INFO L225 Difference]: With dead ends: 367 [2024-11-12 05:52:59,115 INFO L226 Difference]: Without dead ends: 255 [2024-11-12 05:52:59,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 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-11-12 05:52:59,117 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 118 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 05:52:59,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 436 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 05:52:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-12 05:52:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 228. [2024-11-12 05:52:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 143 states have (on average 1.2727272727272727) internal successors, (182), 143 states have internal predecessors, (182), 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-11-12 05:52:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 342 transitions. [2024-11-12 05:52:59,174 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 342 transitions. Word has length 130 [2024-11-12 05:52:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:52:59,175 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 342 transitions. [2024-11-12 05:52:59,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-11-12 05:52:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 342 transitions. [2024-11-12 05:52:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 05:52:59,180 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:52:59,180 INFO L218 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, 1, 1] [2024-11-12 05:52:59,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:52:59,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:52:59,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:52:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash -414183055, now seen corresponding path program 1 times [2024-11-12 05:52:59,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:52:59,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440001499] [2024-11-12 05:52:59,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:52:59,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:52:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:04,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:53:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:04,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:53:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:53:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:53:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:53:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:53:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:53:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:53:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:53:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:53:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:53:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:53:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:53:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:53:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:53:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:53:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:53:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:53:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:53:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:53:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:53:05,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:53:05,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440001499] [2024-11-12 05:53:05,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440001499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:53:05,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:53:05,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 05:53:05,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806977318] [2024-11-12 05:53:05,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:53:05,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 05:53:05,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:53:05,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 05:53:05,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:53:05,177 INFO L87 Difference]: Start difference. First operand 228 states and 342 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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-11-12 05:53:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:53:07,888 INFO L93 Difference]: Finished difference Result 624 states and 914 transitions. [2024-11-12 05:53:07,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 05:53:07,889 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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 130 [2024-11-12 05:53:07,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:53:07,896 INFO L225 Difference]: With dead ends: 624 [2024-11-12 05:53:07,898 INFO L226 Difference]: Without dead ends: 399 [2024-11-12 05:53:07,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-12 05:53:07,905 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 169 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:53:07,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 542 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 05:53:07,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-12 05:53:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 300. [2024-11-12 05:53:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 193 states have (on average 1.2590673575129534) internal successors, (243), 193 states have internal predecessors, (243), 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-11-12 05:53:07,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 443 transitions. [2024-11-12 05:53:07,974 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 443 transitions. Word has length 130 [2024-11-12 05:53:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:53:07,977 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 443 transitions. [2024-11-12 05:53:07,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 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-11-12 05:53:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 443 transitions. [2024-11-12 05:53:07,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 05:53:07,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:53:07,982 INFO L218 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, 1, 1, 1] [2024-11-12 05:53:07,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:53:07,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:53:07,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:53:07,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1321620594, now seen corresponding path program 1 times [2024-11-12 05:53:07,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:53:07,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67947143] [2024-11-12 05:53:07,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:53:07,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:53:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:53:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:53:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:53:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:53:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:53:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:53:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:53:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:53:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:53:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:53:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:53:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:53:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:53:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:53:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:53:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:53:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:53:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:53:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:53:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:53:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:53:08,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:53:08,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67947143] [2024-11-12 05:53:08,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67947143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:53:08,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:53:08,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:53:08,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432293177] [2024-11-12 05:53:08,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:53:08,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:53:08,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:53:08,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:53:08,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:53:08,299 INFO L87 Difference]: Start difference. First operand 300 states and 443 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-11-12 05:53:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:53:08,502 INFO L93 Difference]: Finished difference Result 527 states and 785 transitions. [2024-11-12 05:53:08,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:53:08,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 131 [2024-11-12 05:53:08,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:53:08,509 INFO L225 Difference]: With dead ends: 527 [2024-11-12 05:53:08,509 INFO L226 Difference]: Without dead ends: 411 [2024-11-12 05:53:08,511 INFO L434 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-11-12 05:53:08,512 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 73 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:53:08,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 247 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:53:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-12 05:53:08,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 300. [2024-11-12 05:53:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 193 states have (on average 1.2590673575129534) internal successors, (243), 193 states have internal predecessors, (243), 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-11-12 05:53:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 443 transitions. [2024-11-12 05:53:08,571 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 443 transitions. Word has length 131 [2024-11-12 05:53:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:53:08,572 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 443 transitions. [2024-11-12 05:53:08,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-11-12 05:53:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 443 transitions. [2024-11-12 05:53:08,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 05:53:08,574 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:53:08,574 INFO L218 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, 1, 1, 1] [2024-11-12 05:53:08,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 05:53:08,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:53:08,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:53:08,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1063455156, now seen corresponding path program 1 times [2024-11-12 05:53:08,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:53:08,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909795780] [2024-11-12 05:53:08,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:53:08,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:53:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:53:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:53:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:53:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:53:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:53:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:53:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:53:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:53:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:53:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:53:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:53:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:53:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:53:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:53:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:53:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:53:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:53:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:53:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:53:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:53:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 05:53:08,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:53:08,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909795780] [2024-11-12 05:53:08,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909795780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:53:08,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383331962] [2024-11-12 05:53:08,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:53:08,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:53:08,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:53:08,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:53:08,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:53:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:09,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 05:53:09,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:53:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-12 05:53:09,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:53:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 05:53:09,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383331962] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:53:09,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:53:09,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 05:53:09,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459576087] [2024-11-12 05:53:09,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:53:09,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:53:09,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:53:09,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:53:09,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:53:09,570 INFO L87 Difference]: Start difference. First operand 300 states and 443 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-11-12 05:53:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:53:09,776 INFO L93 Difference]: Finished difference Result 559 states and 803 transitions. [2024-11-12 05:53:09,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 05:53:09,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 131 [2024-11-12 05:53:09,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:53:09,780 INFO L225 Difference]: With dead ends: 559 [2024-11-12 05:53:09,780 INFO L226 Difference]: Without dead ends: 329 [2024-11-12 05:53:09,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 298 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-11-12 05:53:09,783 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 60 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:53:09,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 130 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:53:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-12 05:53:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 293. [2024-11-12 05:53:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 181 states have (on average 1.132596685082873) internal successors, (205), 181 states have internal predecessors, (205), 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-11-12 05:53:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 405 transitions. [2024-11-12 05:53:09,833 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 405 transitions. Word has length 131 [2024-11-12 05:53:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:53:09,834 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 405 transitions. [2024-11-12 05:53:09,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-11-12 05:53:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 405 transitions. [2024-11-12 05:53:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 05:53:09,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:53:09,836 INFO L218 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, 1, 1, 1] [2024-11-12 05:53:09,857 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-11-12 05:53:10,036 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-11-12 05:53:10,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:53:10,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:53:10,037 INFO L85 PathProgramCache]: Analyzing trace with hash 695481101, now seen corresponding path program 1 times [2024-11-12 05:53:10,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:53:10,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717242835] [2024-11-12 05:53:10,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:53:10,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:53:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:53:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:53:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:53:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:53:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:53:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:53:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:53:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:53:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:53:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:53:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:53:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:53:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:53:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:53:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:53:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:53:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:53:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:53:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:53:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:53:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:53:10,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:53:10,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717242835] [2024-11-12 05:53:10,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717242835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:53:10,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:53:10,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:53:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955149893] [2024-11-12 05:53:10,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:53:10,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:53:10,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:53:10,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:53:10,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:53:10,457 INFO L87 Difference]: Start difference. First operand 293 states and 405 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-11-12 05:53:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:53:10,690 INFO L93 Difference]: Finished difference Result 430 states and 594 transitions. [2024-11-12 05:53:10,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:53:10,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 131 [2024-11-12 05:53:10,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:53:10,694 INFO L225 Difference]: With dead ends: 430 [2024-11-12 05:53:10,694 INFO L226 Difference]: Without dead ends: 198 [2024-11-12 05:53:10,695 INFO L434 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-11-12 05:53:10,696 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 45 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:53:10,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 257 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:53:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-12 05:53:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 178. [2024-11-12 05:53:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 110 states have internal predecessors, (124), 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-11-12 05:53:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 244 transitions. [2024-11-12 05:53:10,722 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 244 transitions. Word has length 131 [2024-11-12 05:53:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:53:10,722 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 244 transitions. [2024-11-12 05:53:10,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-11-12 05:53:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 244 transitions. [2024-11-12 05:53:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 05:53:10,724 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:53:10,724 INFO L218 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, 1, 1, 1] [2024-11-12 05:53:10,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 05:53:10,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:53:10,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:53:10,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1282287115, now seen corresponding path program 1 times [2024-11-12 05:53:10,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:53:10,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32832777] [2024-11-12 05:53:10,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:53:10,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:53:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:53:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:53:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:53:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:53:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:53:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:53:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:53:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:53:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:53:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:53:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:53:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:53:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:53:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:53:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:53:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:53:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:53:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:53:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:53:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:53:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 05:53:11,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:53:11,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32832777] [2024-11-12 05:53:11,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32832777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:53:11,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078836465] [2024-11-12 05:53:11,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:53:11,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:53:11,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:53:11,124 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-11-12 05:53:11,126 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-11-12 05:53:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:11,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 05:53:11,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:53:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-12 05:53:11,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:53:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 05:53:11,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078836465] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:53:11,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:53:11,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-12 05:53:11,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269018052] [2024-11-12 05:53:11,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:53:11,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 05:53:11,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:53:11,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 05:53:11,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:53:11,856 INFO L87 Difference]: Start difference. First operand 178 states and 244 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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-11-12 05:53:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:53:12,366 INFO L93 Difference]: Finished difference Result 327 states and 438 transitions. [2024-11-12 05:53:12,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 05:53:12,367 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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 131 [2024-11-12 05:53:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:53:12,369 INFO L225 Difference]: With dead ends: 327 [2024-11-12 05:53:12,369 INFO L226 Difference]: Without dead ends: 210 [2024-11-12 05:53:12,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 294 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-11-12 05:53:12,371 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 116 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:53:12,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 383 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:53:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-12 05:53:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 184. [2024-11-12 05:53:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 114 states have internal predecessors, (127), 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-11-12 05:53:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 247 transitions. [2024-11-12 05:53:12,398 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 247 transitions. Word has length 131 [2024-11-12 05:53:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:53:12,399 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 247 transitions. [2024-11-12 05:53:12,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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-11-12 05:53:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 247 transitions. [2024-11-12 05:53:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 05:53:12,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:53:12,400 INFO L218 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, 1, 1, 1] [2024-11-12 05:53:12,421 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-11-12 05:53:12,604 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-11-12 05:53:12,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:53:12,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:53:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1284134157, now seen corresponding path program 1 times [2024-11-12 05:53:12,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:53:12,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106490008] [2024-11-12 05:53:12,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:53:12,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:53:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:53:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:53:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:53:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:53:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:53:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:53:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:53:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:53:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:53:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:53:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:53:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:53:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:53:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:53:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:53:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:53:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:53:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:53:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:53:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:53:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:53:12,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:53:12,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106490008] [2024-11-12 05:53:12,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106490008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:53:12,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:53:12,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:53:12,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735074179] [2024-11-12 05:53:12,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:53:12,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:53:12,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:53:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:53:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:53:12,765 INFO L87 Difference]: Start difference. First operand 184 states and 247 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11-12 05:53:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:53:12,808 INFO L93 Difference]: Finished difference Result 374 states and 504 transitions. [2024-11-12 05:53:12,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:53:12,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 131 [2024-11-12 05:53:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:53:12,811 INFO L225 Difference]: With dead ends: 374 [2024-11-12 05:53:12,812 INFO L226 Difference]: Without dead ends: 247 [2024-11-12 05:53:12,814 INFO L434 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-11-12 05:53:12,815 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 74 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:53:12,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 166 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:53:12,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-12 05:53:12,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2024-11-12 05:53:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 152 states have (on average 1.118421052631579) internal successors, (170), 152 states have internal predecessors, (170), 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-11-12 05:53:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 330 transitions. [2024-11-12 05:53:12,843 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 330 transitions. Word has length 131 [2024-11-12 05:53:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:53:12,845 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 330 transitions. [2024-11-12 05:53:12,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-11-12 05:53:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 330 transitions. [2024-11-12 05:53:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 05:53:12,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:53:12,848 INFO L218 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, 1, 1, 1] [2024-11-12 05:53:12,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 05:53:12,848 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:53:12,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:53:12,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1191285994, now seen corresponding path program 1 times [2024-11-12 05:53:12,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:53:12,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860994515] [2024-11-12 05:53:12,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:53:12,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:53:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:53:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:53:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:53:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:53:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:53:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:53:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:53:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:53:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:53:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:53:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:53:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:53:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:53:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:53:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:53:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:53:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:53:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:53:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:53:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:53:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:53:13,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:53:13,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860994515] [2024-11-12 05:53:13,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860994515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:53:13,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:53:13,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:53:13,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349903257] [2024-11-12 05:53:13,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:53:13,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:53:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:53:13,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:53:13,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:53:13,058 INFO L87 Difference]: Start difference. First operand 245 states and 330 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-11-12 05:53:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:53:13,225 INFO L93 Difference]: Finished difference Result 549 states and 742 transitions. [2024-11-12 05:53:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:53:13,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 131 [2024-11-12 05:53:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:53:13,228 INFO L225 Difference]: With dead ends: 549 [2024-11-12 05:53:13,229 INFO L226 Difference]: Without dead ends: 365 [2024-11-12 05:53:13,230 INFO L434 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-11-12 05:53:13,230 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 84 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:53:13,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 297 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:53:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-12 05:53:13,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 361. [2024-11-12 05:53:13,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 222 states have (on average 1.1081081081081081) internal successors, (246), 222 states have internal predecessors, (246), 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-11-12 05:53:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 486 transitions. [2024-11-12 05:53:13,267 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 486 transitions. Word has length 131 [2024-11-12 05:53:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:53:13,267 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 486 transitions. [2024-11-12 05:53:13,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-11-12 05:53:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 486 transitions. [2024-11-12 05:53:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 05:53:13,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:53:13,269 INFO L218 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, 1, 1, 1] [2024-11-12 05:53:13,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 05:53:13,269 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:53:13,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:53:13,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1871344364, now seen corresponding path program 1 times [2024-11-12 05:53:13,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:53:13,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544203667] [2024-11-12 05:53:13,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:53:13,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:53:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:53:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:53:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:53:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:53:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:53:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:53:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:53:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 05:53:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:53:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:53:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:53:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:53:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:53:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:53:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:53:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:53:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 05:53:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:53:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:53:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:53:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 24 proven. 33 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-12 05:53:13,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:53:13,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544203667] [2024-11-12 05:53:13,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544203667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:53:13,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797316074] [2024-11-12 05:53:13,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:53:13,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:53:13,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:53:13,938 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-11-12 05:53:13,939 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-11-12 05:53:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:53:14,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-12 05:53:14,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:53:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 471 proven. 126 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-11-12 05:53:16,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:53:48,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797316074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:53:48,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 05:53:48,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 26 [2024-11-12 05:53:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98207733] [2024-11-12 05:53:48,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 05:53:48,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 05:53:48,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:53:48,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 05:53:48,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1158, Unknown=3, NotChecked=0, Total=1560 [2024-11-12 05:53:48,886 INFO L87 Difference]: Start difference. First operand 361 states and 486 transitions. Second operand has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 24 states have internal predecessors, (81), 8 states have call successors, (40), 7 states have call predecessors, (40), 10 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2024-11-12 05:53:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:53:52,298 INFO L93 Difference]: Finished difference Result 532 states and 677 transitions. [2024-11-12 05:53:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-12 05:53:52,299 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 24 states have internal predecessors, (81), 8 states have call successors, (40), 7 states have call predecessors, (40), 10 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) Word has length 131 [2024-11-12 05:53:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:53:52,301 INFO L225 Difference]: With dead ends: 532 [2024-11-12 05:53:52,302 INFO L226 Difference]: Without dead ends: 223 [2024-11-12 05:53:52,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2305 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=2046, Invalid=6323, Unknown=3, NotChecked=0, Total=8372 [2024-11-12 05:53:52,305 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 384 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:53:52,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 454 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 05:53:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-12 05:53:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 197. [2024-11-12 05:53:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 128 states have (on average 1.0390625) internal successors, (133), 129 states have internal predecessors, (133), 48 states have call successors, (48), 20 states have call predecessors, (48), 20 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 05:53:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 229 transitions. [2024-11-12 05:53:52,348 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 229 transitions. Word has length 131 [2024-11-12 05:53:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:53:52,348 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 229 transitions. [2024-11-12 05:53:52,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 24 states have internal predecessors, (81), 8 states have call successors, (40), 7 states have call predecessors, (40), 10 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2024-11-12 05:53:52,349 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2024-11-12 05:53:52,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 05:53:52,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:53:52,350 INFO L218 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, 1, 1, 1, 1] [2024-11-12 05:53:52,370 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-11-12 05:53:52,551 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-11-12 05:53:52,551 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:53:52,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:53:52,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1995455282, now seen corresponding path program 1 times [2024-11-12 05:53:52,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:53:52,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190926957] [2024-11-12 05:53:52,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:53:52,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:53:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:53:52,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1303196444] [2024-11-12 05:53:52,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:53:52,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:53:52,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:53:52,662 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-11-12 05:53:52,663 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-11-12 05:53:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:53:53,441 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:53:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:53:53,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:53:53,596 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:53:53,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:53:53,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 05:53:53,805 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-11-12 05:53:53,809 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:53:53,927 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:53:53,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:53:53 BoogieIcfgContainer [2024-11-12 05:53:53,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:53:53,932 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:53:53,932 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:53:53,933 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:53:53,933 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:52:55" (3/4) ... [2024-11-12 05:53:53,936 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:53:53,937 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:53:53,938 INFO L158 Benchmark]: Toolchain (without parser) took 59419.86ms. Allocated memory was 148.9MB in the beginning and 448.8MB in the end (delta: 299.9MB). Free memory was 92.6MB in the beginning and 246.0MB in the end (delta: -153.4MB). Peak memory consumption was 148.3MB. Max. memory is 16.1GB. [2024-11-12 05:53:53,938 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 148.9MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:53:53,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.05ms. Allocated memory is still 148.9MB. Free memory was 92.6MB in the beginning and 77.2MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 05:53:53,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.07ms. Allocated memory is still 148.9MB. Free memory was 77.2MB in the beginning and 73.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:53:53,938 INFO L158 Benchmark]: Boogie Preprocessor took 80.76ms. Allocated memory is still 148.9MB. Free memory was 73.9MB in the beginning and 70.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:53:53,939 INFO L158 Benchmark]: RCFGBuilder took 603.48ms. Allocated memory was 148.9MB in the beginning and 213.9MB in the end (delta: 65.0MB). Free memory was 70.1MB in the beginning and 175.7MB in the end (delta: -105.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-11-12 05:53:53,939 INFO L158 Benchmark]: TraceAbstraction took 58259.05ms. Allocated memory was 213.9MB in the beginning and 448.8MB in the end (delta: 234.9MB). Free memory was 175.7MB in the beginning and 246.0MB in the end (delta: -70.3MB). Peak memory consumption was 164.6MB. Max. memory is 16.1GB. [2024-11-12 05:53:53,939 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 448.8MB. Free memory is still 246.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:53:53,940 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.25ms. Allocated memory is still 148.9MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.05ms. Allocated memory is still 148.9MB. Free memory was 92.6MB in the beginning and 77.2MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.07ms. Allocated memory is still 148.9MB. Free memory was 77.2MB in the beginning and 73.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.76ms. Allocated memory is still 148.9MB. Free memory was 73.9MB in the beginning and 70.1MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 603.48ms. Allocated memory was 148.9MB in the beginning and 213.9MB in the end (delta: 65.0MB). Free memory was 70.1MB in the beginning and 175.7MB in the end (delta: -105.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * TraceAbstraction took 58259.05ms. Allocated memory was 213.9MB in the beginning and 448.8MB in the end (delta: 234.9MB). Free memory was 175.7MB in the beginning and 246.0MB in the end (delta: -70.3MB). Peak memory consumption was 164.6MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 448.8MB. Free memory is still 246.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of 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; VAL [isInitial=0, 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] [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 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] [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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741826, 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=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, 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=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, 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=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, 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=-1073741842, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, 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=-1073741842, var_1_10=0, var_1_11=78/5, var_1_14=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, 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=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, 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=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, 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=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, 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=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, 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=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, 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) ; VAL [\result=0, 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=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, 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] [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=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, 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=-1073741842, var_1_15=2147483647, var_1_16=-1073741826, 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, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.1s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1191 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1170 mSDsluCounter, 3172 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2112 mSDsCounter, 525 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2303 IncrementalHoareTripleChecker+Invalid, 2828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 525 mSolverCounterUnsat, 1060 mSDtfsCounter, 2303 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1364 GetRequests, 1207 SyntacticMatches, 4 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2416 ImplicationChecksByTransitivity, 33.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=10, InterpolantAutomatonStates: 120, 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, 353 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 45.6s InterpolantComputationTime, 2093 NumberOfCodeBlocks, 2093 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2075 ConstructedInterpolants, 0 QuantifiedInterpolants, 10917 SizeOfPredicates, 12 NumberOfNonLiveVariables, 939 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 11695/12160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:53:54,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_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 fb80e4f0533bc0d87718a3c946d158e7005d734d62d8e11c16c799aba4b0f82b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:53:56,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:53:56,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:53:56,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:53:56,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:53:56,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:53:56,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:53:56,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:53:56,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:53:56,353 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:53:56,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:53:56,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:53:56,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:53:56,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:53:56,355 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:53:56,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:53:56,356 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:53:56,357 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:53:56,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:53:56,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:53:56,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:53:56,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:53:56,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:53:56,363 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:53:56,363 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:53:56,364 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:53:56,364 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:53:56,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:53:56,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:53:56,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:53:56,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:53:56,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:53:56,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:53:56,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:53:56,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:53:56,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:53:56,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:53:56,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:53:56,369 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:53:56,370 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:53:56,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:53:56,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:53:56,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:53:56,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:53:56,372 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 -> fb80e4f0533bc0d87718a3c946d158e7005d734d62d8e11c16c799aba4b0f82b [2024-11-12 05:53:56,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:53:56,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:53:56,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:53:56,748 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:53:56,749 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:53:56,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i [2024-11-12 05:53:58,389 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:53:58,598 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:53:58,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i [2024-11-12 05:53:58,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b036c7c9/33ce15cea8b248ce94857db747d0d866/FLAG22d9666f1 [2024-11-12 05:53:58,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b036c7c9/33ce15cea8b248ce94857db747d0d866 [2024-11-12 05:53:58,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:53:58,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:53:58,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:53:58,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:53:58,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:53:58,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:53:58" (1/1) ... [2024-11-12 05:53:58,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2571d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:58, skipping insertion in model container [2024-11-12 05:53:58,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:53:58" (1/1) ... [2024-11-12 05:53:58,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:53:58,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i[914,927] [2024-11-12 05:53:58,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:53:58,949 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:53:58,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-4.i[914,927] [2024-11-12 05:53:59,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:53:59,023 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:53:59,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59 WrapperNode [2024-11-12 05:53:59,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:53:59,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:53:59,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:53:59,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:53:59,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59" (1/1) ... [2024-11-12 05:53:59,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59" (1/1) ... [2024-11-12 05:53:59,068 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-12 05:53:59,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:53:59,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:53:59,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:53:59,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:53:59,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59" (1/1) ... [2024-11-12 05:53:59,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59" (1/1) ... [2024-11-12 05:53:59,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59" (1/1) ... [2024-11-12 05:53:59,110 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:53:59,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59" (1/1) ... [2024-11-12 05:53:59,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59" (1/1) ... [2024-11-12 05:53:59,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59" (1/1) ... [2024-11-12 05:53:59,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59" (1/1) ... [2024-11-12 05:53:59,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59" (1/1) ... [2024-11-12 05:53:59,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59" (1/1) ... [2024-11-12 05:53:59,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:53:59,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:53:59,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:53:59,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:53:59,132 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59" (1/1) ... [2024-11-12 05:53:59,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:53:59,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:53:59,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:53:59,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:53:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:53:59,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:53:59,232 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:53:59,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:53:59,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:53:59,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:53:59,317 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:53:59,324 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:54:00,082 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 05:54:00,082 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:54:00,102 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:54:00,102 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:54:00,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:54:00 BoogieIcfgContainer [2024-11-12 05:54:00,103 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:54:00,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:54:00,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:54:00,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:54:00,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:53:58" (1/3) ... [2024-11-12 05:54:00,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ced0591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:54:00, skipping insertion in model container [2024-11-12 05:54:00,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:53:59" (2/3) ... [2024-11-12 05:54:00,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ced0591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:54:00, skipping insertion in model container [2024-11-12 05:54:00,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:54:00" (3/3) ... [2024-11-12 05:54:00,113 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-4.i [2024-11-12 05:54:00,128 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:54:00,128 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:54:00,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:54:00,188 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;@62aa8d9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:54:00,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:54:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 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-11-12 05:54:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 05:54:00,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:54:00,215 INFO L218 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, 1] [2024-11-12 05:54:00,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:54:00,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:54:00,221 INFO L85 PathProgramCache]: Analyzing trace with hash -246695732, now seen corresponding path program 1 times [2024-11-12 05:54:00,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:54:00,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500005378] [2024-11-12 05:54:00,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:54:00,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:54:00,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:54:00,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:54:00,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:54:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:00,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:54:00,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:54:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-12 05:54:00,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:54:00,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:54:00,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500005378] [2024-11-12 05:54:00,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500005378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:54:00,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:54:00,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:54:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982101929] [2024-11-12 05:54:00,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:54:00,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:54:00,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:54:00,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:54:00,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:54:00,625 INFO L87 Difference]: Start difference. First operand has 64 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 05:54:00,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:54:00,660 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2024-11-12 05:54:00,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:54:00,663 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-12 05:54:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:54:00,673 INFO L225 Difference]: With dead ends: 121 [2024-11-12 05:54:00,673 INFO L226 Difference]: Without dead ends: 60 [2024-11-12 05:54:00,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:54:00,681 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:54:00,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:54:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-12 05:54:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-12 05:54:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 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-11-12 05:54:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-12 05:54:00,720 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2024-11-12 05:54:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:54:00,721 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-12 05:54:00,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-12 05:54:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-12 05:54:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 05:54:00,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:54:00,725 INFO L218 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, 1, 1] [2024-11-12 05:54:00,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 05:54:00,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:54:00,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:54:00,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:54:00,928 INFO L85 PathProgramCache]: Analyzing trace with hash -157864659, now seen corresponding path program 1 times [2024-11-12 05:54:00,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:54:00,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251645770] [2024-11-12 05:54:00,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:54:00,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:54:00,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:54:00,931 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:54:00,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:54:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:01,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 05:54:01,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:54:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-12 05:54:02,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:54:02,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:54:02,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251645770] [2024-11-12 05:54:02,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251645770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:54:02,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:54:02,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:54:02,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347376355] [2024-11-12 05:54:02,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:54:02,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:54:02,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:54:02,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:54:02,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:54:02,257 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-11-12 05:54:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:54:03,193 INFO L93 Difference]: Finished difference Result 175 states and 262 transitions. [2024-11-12 05:54:03,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:54:03,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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 130 [2024-11-12 05:54:03,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:54:03,205 INFO L225 Difference]: With dead ends: 175 [2024-11-12 05:54:03,205 INFO L226 Difference]: Without dead ends: 118 [2024-11-12 05:54:03,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 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-11-12 05:54:03,207 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 51 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 05:54:03,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 272 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 05:54:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-12 05:54:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2024-11-12 05:54:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 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-11-12 05:54:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2024-11-12 05:54:03,241 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 130 [2024-11-12 05:54:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:54:03,242 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2024-11-12 05:54:03,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-11-12 05:54:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2024-11-12 05:54:03,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-12 05:54:03,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:54:03,245 INFO L218 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, 1, 1] [2024-11-12 05:54:03,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 05:54:03,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:54:03,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:54:03,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:54:03,450 INFO L85 PathProgramCache]: Analyzing trace with hash -416030097, now seen corresponding path program 1 times [2024-11-12 05:54:03,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:54:03,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125335980] [2024-11-12 05:54:03,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:54:03,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:54:03,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:54:03,454 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:54:03,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 05:54:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:03,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 05:54:03,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:54:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 179 proven. 99 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-11-12 05:54:04,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:54:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 102 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-12 05:54:05,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:54:05,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125335980] [2024-11-12 05:54:05,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125335980] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:54:05,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 05:54:05,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-12 05:54:05,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98231124] [2024-11-12 05:54:05,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 05:54:05,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 05:54:05,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:54:05,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 05:54:05,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-12 05:54:05,179 INFO L87 Difference]: Start difference. First operand 101 states and 151 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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-11-12 05:54:06,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:54:06,763 INFO L93 Difference]: Finished difference Result 200 states and 276 transitions. [2024-11-12 05:54:06,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 05:54:06,764 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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 130 [2024-11-12 05:54:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:54:06,769 INFO L225 Difference]: With dead ends: 200 [2024-11-12 05:54:06,770 INFO L226 Difference]: Without dead ends: 140 [2024-11-12 05:54:06,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-11-12 05:54:06,774 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 151 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:54:06,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 237 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 05:54:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-12 05:54:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2024-11-12 05:54:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.095890410958904) internal successors, (80), 73 states have internal predecessors, (80), 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-11-12 05:54:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 160 transitions. [2024-11-12 05:54:06,807 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 160 transitions. Word has length 130 [2024-11-12 05:54:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:54:06,808 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 160 transitions. [2024-11-12 05:54:06,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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-11-12 05:54:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 160 transitions. [2024-11-12 05:54:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 05:54:06,811 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:54:06,811 INFO L218 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, 1, 1, 1] [2024-11-12 05:54:06,820 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-11-12 05:54:07,012 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-11-12 05:54:07,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:54:07,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:54:07,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1983351693, now seen corresponding path program 1 times [2024-11-12 05:54:07,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:54:07,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941081969] [2024-11-12 05:54:07,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:54:07,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:54:07,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:54:07,018 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-11-12 05:54:07,020 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-11-12 05:54:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:54:07,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 05:54:07,194 INFO L279 TraceCheckSpWp]: Computing forward predicates...