./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:33:05,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:33:05,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:33:05,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:33:05,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:33:05,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:33:05,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:33:05,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:33:05,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:33:05,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:33:05,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:33:05,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:33:05,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:33:05,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:33:05,171 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:33:05,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:33:05,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:33:05,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:33:05,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:33:05,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:33:05,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:33:05,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:33:05,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:33:05,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:33:05,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:33:05,175 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:33:05,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:33:05,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:33:05,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:33:05,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:33:05,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:33:05,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:33:05,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:33:05,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:33:05,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:33:05,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:33:05,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:33:05,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:33:05,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:33:05,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:33:05,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:33:05,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:33:05,178 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d [2024-10-24 08:33:05,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:33:05,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:33:05,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:33:05,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:33:05,381 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:33:05,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i [2024-10-24 08:33:06,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:33:06,751 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:33:06,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i [2024-10-24 08:33:06,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47be2abd3/1e3145209564484d9c2cf0b8076133ef/FLAG454af237c [2024-10-24 08:33:07,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47be2abd3/1e3145209564484d9c2cf0b8076133ef [2024-10-24 08:33:07,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:33:07,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:33:07,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:33:07,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:33:07,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:33:07,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22909c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07, skipping insertion in model container [2024-10-24 08:33:07,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:33:07,313 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i[912,925] [2024-10-24 08:33:07,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:33:07,362 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:33:07,373 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i[912,925] [2024-10-24 08:33:07,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:33:07,406 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:33:07,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07 WrapperNode [2024-10-24 08:33:07,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:33:07,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:33:07,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:33:07,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:33:07,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,446 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-10-24 08:33:07,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:33:07,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:33:07,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:33:07,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:33:07,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,470 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:33:07,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:33:07,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:33:07,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:33:07,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:33:07,494 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07" (1/1) ... [2024-10-24 08:33:07,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:33:07,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:33:07,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:33:07,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:33:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:33:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:33:07,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:33:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:33:07,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:33:07,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:33:07,641 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:33:07,643 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:33:07,896 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 08:33:07,897 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:33:07,946 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:33:07,947 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:33:07,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:33:07 BoogieIcfgContainer [2024-10-24 08:33:07,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:33:07,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:33:07,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:33:07,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:33:07,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:33:07" (1/3) ... [2024-10-24 08:33:07,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2836c653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:33:07, skipping insertion in model container [2024-10-24 08:33:07,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:07" (2/3) ... [2024-10-24 08:33:07,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2836c653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:33:07, skipping insertion in model container [2024-10-24 08:33:07,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:33:07" (3/3) ... [2024-10-24 08:33:07,953 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-4.i [2024-10-24 08:33:07,964 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:33:07,965 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:33:08,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:33:08,013 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;@d7fd471, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:33:08,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:33:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:33:08,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 08:33:08,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:08,030 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:08,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:08,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash -279030631, now seen corresponding path program 1 times [2024-10-24 08:33:08,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:33:08,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594050849] [2024-10-24 08:33:08,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:08,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:33:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:33:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:33:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:33:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:33:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:33:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:33:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:33:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:33:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:33:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:33:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:33:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:33:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:33:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:33:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:33:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:33:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:33:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:33:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:33:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:33:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:33:08,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:33:08,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594050849] [2024-10-24 08:33:08,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594050849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:33:08,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:33:08,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:33:08,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960079399] [2024-10-24 08:33:08,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:33:08,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:33:08,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:33:08,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:33:08,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:33:08,367 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 08:33:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:08,402 INFO L93 Difference]: Finished difference Result 113 states and 200 transitions. [2024-10-24 08:33:08,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:33:08,404 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-10-24 08:33:08,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:08,409 INFO L225 Difference]: With dead ends: 113 [2024-10-24 08:33:08,409 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 08:33:08,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:33:08,415 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:08,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:33:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 08:33:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-24 08:33:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:33:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2024-10-24 08:33:08,491 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 125 [2024-10-24 08:33:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:08,494 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2024-10-24 08:33:08,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 08:33:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2024-10-24 08:33:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 08:33:08,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:08,500 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:08,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:33:08,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:08,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1621605454, now seen corresponding path program 1 times [2024-10-24 08:33:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:33:08,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396080101] [2024-10-24 08:33:08,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:08,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:33:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:33:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:33:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:08,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:33:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:33:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:33:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:33:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:33:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:33:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:33:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:33:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:33:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:33:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:33:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:33:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:33:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:33:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:33:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:33:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:33:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:33:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:33:09,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:33:09,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396080101] [2024-10-24 08:33:09,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396080101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:33:09,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:33:09,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:33:09,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086964503] [2024-10-24 08:33:09,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:33:09,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:33:09,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:33:09,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:33:09,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:33:09,148 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:09,223 INFO L93 Difference]: Finished difference Result 166 states and 253 transitions. [2024-10-24 08:33:09,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:33:09,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-24 08:33:09,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:09,227 INFO L225 Difference]: With dead ends: 166 [2024-10-24 08:33:09,228 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 08:33:09,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:33:09,231 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 46 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:09,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 162 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:33:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 08:33:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-10-24 08:33:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 66 states have internal predecessors, (87), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 08:33:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2024-10-24 08:33:09,268 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 126 [2024-10-24 08:33:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:09,268 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2024-10-24 08:33:09,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2024-10-24 08:33:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 08:33:09,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:09,270 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:09,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:33:09,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:09,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1972297264, now seen corresponding path program 1 times [2024-10-24 08:33:09,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:33:09,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368732087] [2024-10-24 08:33:09,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:09,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:33:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:33:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:33:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:33:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:33:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:33:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:33:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:33:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:33:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:33:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:33:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:33:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:33:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:33:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:33:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:33:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:33:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:33:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:33:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:33:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:33:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:33:09,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:33:09,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368732087] [2024-10-24 08:33:09,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368732087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:33:09,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:33:09,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:33:09,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399372511] [2024-10-24 08:33:09,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:33:09,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:33:09,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:33:09,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:33:09,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:33:09,866 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:10,148 INFO L93 Difference]: Finished difference Result 348 states and 527 transitions. [2024-10-24 08:33:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:33:10,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-24 08:33:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:10,151 INFO L225 Difference]: With dead ends: 348 [2024-10-24 08:33:10,153 INFO L226 Difference]: Without dead ends: 240 [2024-10-24 08:33:10,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:33:10,155 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 108 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:10,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 411 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:33:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-24 08:33:10,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 218. [2024-10-24 08:33:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 133 states have (on average 1.2932330827067668) internal successors, (172), 133 states have internal predecessors, (172), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 08:33:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 332 transitions. [2024-10-24 08:33:10,193 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 332 transitions. Word has length 126 [2024-10-24 08:33:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:10,194 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 332 transitions. [2024-10-24 08:33:10,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 332 transitions. [2024-10-24 08:33:10,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 08:33:10,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:10,196 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:10,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:33:10,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:10,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:10,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1972356846, now seen corresponding path program 1 times [2024-10-24 08:33:10,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:33:10,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046664078] [2024-10-24 08:33:10,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:10,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:33:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:33:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:33:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:33:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:33:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:33:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:33:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:33:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:33:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:33:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:33:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:33:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:33:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:33:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:33:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:33:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:33:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:33:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:33:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:33:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:33:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:33:13,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:33:13,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046664078] [2024-10-24 08:33:13,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046664078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:33:13,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:33:13,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 08:33:13,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140050738] [2024-10-24 08:33:13,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:33:13,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 08:33:13,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:33:13,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 08:33:13,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-24 08:33:13,702 INFO L87 Difference]: Start difference. First operand 218 states and 332 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:14,406 INFO L93 Difference]: Finished difference Result 602 states and 900 transitions. [2024-10-24 08:33:14,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 08:33:14,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-24 08:33:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:14,409 INFO L225 Difference]: With dead ends: 602 [2024-10-24 08:33:14,409 INFO L226 Difference]: Without dead ends: 385 [2024-10-24 08:33:14,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-24 08:33:14,411 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 144 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:14,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 378 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:33:14,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-24 08:33:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 292. [2024-10-24 08:33:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 185 states have (on average 1.281081081081081) internal successors, (237), 185 states have internal predecessors, (237), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-24 08:33:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 437 transitions. [2024-10-24 08:33:14,464 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 437 transitions. Word has length 126 [2024-10-24 08:33:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:14,465 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 437 transitions. [2024-10-24 08:33:14,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 437 transitions. [2024-10-24 08:33:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 08:33:14,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:14,467 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:14,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:33:14,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:14,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash -55763085, now seen corresponding path program 1 times [2024-10-24 08:33:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:33:14,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884655569] [2024-10-24 08:33:14,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:14,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:33:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:33:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:33:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:33:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:33:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:33:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:33:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:33:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:33:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:33:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:33:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:33:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:33:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:33:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:33:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:33:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:33:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:33:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:33:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:33:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:33:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,652 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:33:14,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:33:14,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884655569] [2024-10-24 08:33:14,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884655569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:33:14,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:33:14,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:33:14,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781862542] [2024-10-24 08:33:14,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:33:14,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:33:14,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:33:14,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:33:14,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:33:14,657 INFO L87 Difference]: Start difference. First operand 292 states and 437 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:14,802 INFO L93 Difference]: Finished difference Result 511 states and 771 transitions. [2024-10-24 08:33:14,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:33:14,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-24 08:33:14,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:14,805 INFO L225 Difference]: With dead ends: 511 [2024-10-24 08:33:14,806 INFO L226 Difference]: Without dead ends: 399 [2024-10-24 08:33:14,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:33:14,808 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 68 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:14,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 236 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:33:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-24 08:33:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 288. [2024-10-24 08:33:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 181 states have (on average 1.276243093922652) internal successors, (231), 181 states have internal predecessors, (231), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-24 08:33:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 431 transitions. [2024-10-24 08:33:14,843 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 431 transitions. Word has length 127 [2024-10-24 08:33:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:14,844 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 431 transitions. [2024-10-24 08:33:14,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 431 transitions. [2024-10-24 08:33:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 08:33:14,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:14,845 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:14,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:33:14,846 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:14,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:14,846 INFO L85 PathProgramCache]: Analyzing trace with hash -756827663, now seen corresponding path program 1 times [2024-10-24 08:33:14,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:33:14,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198338648] [2024-10-24 08:33:14,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:14,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:33:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:33:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:33:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:33:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:14,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:33:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:33:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:33:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:33:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:33:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:33:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:33:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:33:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:33:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:33:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:33:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:33:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:33:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:33:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:33:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:33:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:33:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 08:33:15,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:33:15,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198338648] [2024-10-24 08:33:15,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198338648] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:33:15,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321794697] [2024-10-24 08:33:15,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:15,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:33:15,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:33:15,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:33:15,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 08:33:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:15,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:33:15,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:33:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-10-24 08:33:15,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:33:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 08:33:15,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321794697] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:33:15,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:33:15,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 08:33:15,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029074368] [2024-10-24 08:33:15,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:33:15,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:33:15,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:33:15,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:33:15,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:33:15,588 INFO L87 Difference]: Start difference. First operand 288 states and 431 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-24 08:33:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:15,763 INFO L93 Difference]: Finished difference Result 539 states and 783 transitions. [2024-10-24 08:33:15,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 08:33:15,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 127 [2024-10-24 08:33:15,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:15,765 INFO L225 Difference]: With dead ends: 539 [2024-10-24 08:33:15,766 INFO L226 Difference]: Without dead ends: 317 [2024-10-24 08:33:15,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:33:15,769 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 52 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:15,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 114 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:33:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-24 08:33:15,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 281. [2024-10-24 08:33:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 169 states have (on average 1.1420118343195267) internal successors, (193), 169 states have internal predecessors, (193), 100 states have call successors, (100), 11 states have call predecessors, (100), 11 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-24 08:33:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 393 transitions. [2024-10-24 08:33:15,818 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 393 transitions. Word has length 127 [2024-10-24 08:33:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:15,820 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 393 transitions. [2024-10-24 08:33:15,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-24 08:33:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 393 transitions. [2024-10-24 08:33:15,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 08:33:15,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:15,822 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:15,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 08:33:16,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 08:33:16,024 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:16,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1170964856, now seen corresponding path program 1 times [2024-10-24 08:33:16,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:33:16,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29745441] [2024-10-24 08:33:16,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:16,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:33:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:33:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:33:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:33:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:33:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:33:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:33:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:33:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:33:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:33:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:33:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:33:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:33:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:33:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:33:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:33:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:33:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:33:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:33:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:33:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:33:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:33:16,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:33:16,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29745441] [2024-10-24 08:33:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29745441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:33:16,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:33:16,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:33:16,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443982696] [2024-10-24 08:33:16,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:33:16,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:33:16,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:33:16,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:33:16,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:33:16,326 INFO L87 Difference]: Start difference. First operand 281 states and 393 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:16,516 INFO L93 Difference]: Finished difference Result 412 states and 576 transitions. [2024-10-24 08:33:16,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:33:16,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-24 08:33:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:16,519 INFO L225 Difference]: With dead ends: 412 [2024-10-24 08:33:16,519 INFO L226 Difference]: Without dead ends: 188 [2024-10-24 08:33:16,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:33:16,520 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 41 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:16,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 244 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:33:16,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-24 08:33:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2024-10-24 08:33:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 102 states have (on average 1.1372549019607843) internal successors, (116), 102 states have internal predecessors, (116), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 08:33:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 236 transitions. [2024-10-24 08:33:16,542 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 236 transitions. Word has length 127 [2024-10-24 08:33:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:16,542 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 236 transitions. [2024-10-24 08:33:16,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 236 transitions. [2024-10-24 08:33:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 08:33:16,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:16,544 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:16,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 08:33:16,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:16,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:16,544 INFO L85 PathProgramCache]: Analyzing trace with hash 912799418, now seen corresponding path program 1 times [2024-10-24 08:33:16,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:33:16,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610441965] [2024-10-24 08:33:16,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:16,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:33:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:33:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:33:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:33:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:33:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:33:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:33:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:33:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:33:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:33:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:33:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:33:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:33:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:33:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:33:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:33:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:33:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:33:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:33:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:33:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:33:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 08:33:16,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:33:16,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610441965] [2024-10-24 08:33:16,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610441965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:33:16,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693685026] [2024-10-24 08:33:16,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:16,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:33:16,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:33:16,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:33:16,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 08:33:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:16,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 08:33:16,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:33:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-10-24 08:33:17,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:33:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 08:33:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693685026] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:33:17,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:33:17,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-10-24 08:33:17,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189622865] [2024-10-24 08:33:17,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:33:17,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 08:33:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:33:17,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 08:33:17,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 08:33:17,269 INFO L87 Difference]: Start difference. First operand 170 states and 236 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 08:33:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:17,694 INFO L93 Difference]: Finished difference Result 315 states and 426 transitions. [2024-10-24 08:33:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 08:33:17,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 127 [2024-10-24 08:33:17,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:17,696 INFO L225 Difference]: With dead ends: 315 [2024-10-24 08:33:17,696 INFO L226 Difference]: Without dead ends: 202 [2024-10-24 08:33:17,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 288 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-24 08:33:17,697 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 61 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:17,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 365 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 08:33:17,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-24 08:33:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 176. [2024-10-24 08:33:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 106 states have (on average 1.1226415094339623) internal successors, (119), 106 states have internal predecessors, (119), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 08:33:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 239 transitions. [2024-10-24 08:33:17,719 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 239 transitions. Word has length 127 [2024-10-24 08:33:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:17,719 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 239 transitions. [2024-10-24 08:33:17,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 08:33:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 239 transitions. [2024-10-24 08:33:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 08:33:17,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:17,720 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:17,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 08:33:17,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-24 08:33:17,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:17,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:17,921 INFO L85 PathProgramCache]: Analyzing trace with hash 912859000, now seen corresponding path program 1 times [2024-10-24 08:33:17,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:33:17,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034181213] [2024-10-24 08:33:17,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:17,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:33:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:33:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:33:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:33:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:33:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:33:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:33:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:33:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:33:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:33:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:33:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:33:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:33:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:33:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:33:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:33:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:33:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:33:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:33:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:33:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:33:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:33:18,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:33:18,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034181213] [2024-10-24 08:33:18,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034181213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:33:18,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:33:18,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:33:18,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110125163] [2024-10-24 08:33:18,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:33:18,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:33:18,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:33:18,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:33:18,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:33:18,032 INFO L87 Difference]: Start difference. First operand 176 states and 239 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:18,076 INFO L93 Difference]: Finished difference Result 360 states and 490 transitions. [2024-10-24 08:33:18,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:33:18,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-24 08:33:18,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:18,081 INFO L225 Difference]: With dead ends: 360 [2024-10-24 08:33:18,081 INFO L226 Difference]: Without dead ends: 237 [2024-10-24 08:33:18,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:33:18,082 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 70 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:18,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 155 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:33:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-24 08:33:18,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2024-10-24 08:33:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 142 states have (on average 1.1267605633802817) internal successors, (160), 142 states have internal predecessors, (160), 80 states have call successors, (80), 12 states have call predecessors, (80), 12 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 08:33:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 320 transitions. [2024-10-24 08:33:18,115 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 320 transitions. Word has length 127 [2024-10-24 08:33:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:18,116 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 320 transitions. [2024-10-24 08:33:18,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:18,116 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 320 transitions. [2024-10-24 08:33:18,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 08:33:18,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:18,117 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:18,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 08:33:18,117 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:18,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:18,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2018242555, now seen corresponding path program 1 times [2024-10-24 08:33:18,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:33:18,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971705704] [2024-10-24 08:33:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:33:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:33:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:33:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:33:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:33:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:33:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:33:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:33:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:33:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:33:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:33:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:33:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:33:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:33:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:33:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:33:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:33:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:33:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:33:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:33:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:33:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:33:18,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:33:18,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971705704] [2024-10-24 08:33:18,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971705704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:33:18,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:33:18,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:33:18,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669100492] [2024-10-24 08:33:18,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:33:18,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:33:18,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:33:18,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:33:18,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:33:18,265 INFO L87 Difference]: Start difference. First operand 235 states and 320 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:18,397 INFO L93 Difference]: Finished difference Result 529 states and 722 transitions. [2024-10-24 08:33:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:33:18,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-24 08:33:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:18,400 INFO L225 Difference]: With dead ends: 529 [2024-10-24 08:33:18,400 INFO L226 Difference]: Without dead ends: 351 [2024-10-24 08:33:18,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:33:18,401 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 82 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:18,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 281 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:33:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-24 08:33:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 347. [2024-10-24 08:33:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 208 states have (on average 1.1153846153846154) internal successors, (232), 208 states have internal predecessors, (232), 120 states have call successors, (120), 18 states have call predecessors, (120), 18 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-24 08:33:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 472 transitions. [2024-10-24 08:33:18,432 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 472 transitions. Word has length 127 [2024-10-24 08:33:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:18,433 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 472 transitions. [2024-10-24 08:33:18,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 472 transitions. [2024-10-24 08:33:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 08:33:18,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:18,434 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:18,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 08:33:18,434 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:18,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1208895929, now seen corresponding path program 1 times [2024-10-24 08:33:18,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:33:18,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468090469] [2024-10-24 08:33:18,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:18,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:33:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:33:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:33:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:33:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:33:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:33:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:33:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:33:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:33:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:33:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:33:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:33:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:33:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:33:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:33:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:33:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:33:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:33:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:33:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:33:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:33:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 24 proven. 33 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 08:33:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:33:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468090469] [2024-10-24 08:33:19,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468090469] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:33:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121480538] [2024-10-24 08:33:19,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:19,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:33:19,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:33:19,163 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:33:19,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 08:33:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:19,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 08:33:19,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:33:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 400 proven. 60 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-24 08:33:20,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:33:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 63 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-10-24 08:33:20,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121480538] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:33:20,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:33:20,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 26 [2024-10-24 08:33:20,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230744387] [2024-10-24 08:33:20,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:33:20,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 08:33:20,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:33:20,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 08:33:20,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2024-10-24 08:33:20,860 INFO L87 Difference]: Start difference. First operand 347 states and 472 transitions. Second operand has 26 states, 25 states have (on average 3.4) internal successors, (85), 24 states have internal predecessors, (85), 8 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-10-24 08:33:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:22,071 INFO L93 Difference]: Finished difference Result 473 states and 622 transitions. [2024-10-24 08:33:22,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-24 08:33:22,075 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 3.4) internal successors, (85), 24 states have internal predecessors, (85), 8 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) Word has length 127 [2024-10-24 08:33:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:22,077 INFO L225 Difference]: With dead ends: 473 [2024-10-24 08:33:22,077 INFO L226 Difference]: Without dead ends: 175 [2024-10-24 08:33:22,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=713, Invalid=1837, Unknown=0, NotChecked=0, Total=2550 [2024-10-24 08:33:22,079 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 415 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:22,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 351 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 08:33:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-24 08:33:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 125. [2024-10-24 08:33:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 08:33:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2024-10-24 08:33:22,098 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 127 [2024-10-24 08:33:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:22,098 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2024-10-24 08:33:22,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.4) internal successors, (85), 24 states have internal predecessors, (85), 8 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-10-24 08:33:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2024-10-24 08:33:22,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 08:33:22,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:22,100 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:22,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 08:33:22,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:33:22,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:22,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:22,301 INFO L85 PathProgramCache]: Analyzing trace with hash -761419599, now seen corresponding path program 1 times [2024-10-24 08:33:22,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:33:22,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375115151] [2024-10-24 08:33:22,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:22,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:33:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:33:22,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1743478362] [2024-10-24 08:33:22,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:22,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:33:22,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:33:22,360 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:33:22,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 08:33:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:33:22,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:33:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:33:22,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:33:22,531 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:33:22,532 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:33:22,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 08:33:22,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:33:22,736 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:22,816 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:33:22,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:33:22 BoogieIcfgContainer [2024-10-24 08:33:22,818 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:33:22,819 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:33:22,819 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:33:22,819 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:33:22,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:33:07" (3/4) ... [2024-10-24 08:33:22,820 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:33:22,821 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:33:22,822 INFO L158 Benchmark]: Toolchain (without parser) took 15669.40ms. Allocated memory was 146.8MB in the beginning and 373.3MB in the end (delta: 226.5MB). Free memory was 74.9MB in the beginning and 332.5MB in the end (delta: -257.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:33:22,822 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 146.8MB. Free memory is still 109.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:33:22,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.96ms. Allocated memory is still 146.8MB. Free memory was 74.9MB in the beginning and 59.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 08:33:22,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.56ms. Allocated memory is still 146.8MB. Free memory was 59.2MB in the beginning and 56.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:33:22,823 INFO L158 Benchmark]: Boogie Preprocessor took 40.86ms. Allocated memory is still 146.8MB. Free memory was 56.4MB in the beginning and 52.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 08:33:22,823 INFO L158 Benchmark]: RCFGBuilder took 454.51ms. Allocated memory was 146.8MB in the beginning and 178.3MB in the end (delta: 31.5MB). Free memory was 52.2MB in the beginning and 125.9MB in the end (delta: -73.7MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-10-24 08:33:22,823 INFO L158 Benchmark]: TraceAbstraction took 14869.61ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 124.9MB in the beginning and 333.6MB in the end (delta: -208.7MB). Peak memory consumption was 204.4MB. Max. memory is 16.1GB. [2024-10-24 08:33:22,823 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 373.3MB. Free memory is still 332.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:33:22,824 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 146.8MB. Free memory is still 109.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.96ms. Allocated memory is still 146.8MB. Free memory was 74.9MB in the beginning and 59.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.56ms. Allocated memory is still 146.8MB. Free memory was 59.2MB in the beginning and 56.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.86ms. Allocated memory is still 146.8MB. Free memory was 56.4MB in the beginning and 52.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 454.51ms. Allocated memory was 146.8MB in the beginning and 178.3MB in the end (delta: 31.5MB). Free memory was 52.2MB in the beginning and 125.9MB in the end (delta: -73.7MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14869.61ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 124.9MB in the beginning and 333.6MB in the end (delta: -208.7MB). Peak memory consumption was 204.4MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 373.3MB. Free memory is still 332.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] unsigned short int last_1_var_1_6 = 4; [L40] unsigned short int last_1_var_1_9 = 4; [L41] unsigned long int last_1_var_1_14 = 500; [L42] signed short int last_1_var_1_17 = 16; [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L125] last_1_var_1_6 = var_1_6 [L126] last_1_var_1_9 = var_1_9 [L127] last_1_var_1_14 = var_1_14 [L128] last_1_var_1_17 = var_1_17 [L138] RET updateLastVariables() [L139] CALL updateVariables() [L92] var_1_4 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L93] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L94] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L94] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L95] var_1_5 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L96] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L97] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L98] var_1_10 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L101] var_1_12 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L102] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L103] var_1_13 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L104] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L105] var_1_15 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L106] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L108] var_1_16 = __VERIFIER_nondet_ulong() [L109] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L109] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L111] var_1_19 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L112] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L114] var_1_20 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L115] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L117] var_1_21 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L118] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] var_1_22 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] RET updateVariables() [L140] CALL step() [L46] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L47] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L52] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L53] COND TRUE last_1_var_1_14 >= stepLocal_3 [L54] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L56] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L57] COND TRUE (- var_1_14) > var_1_6 [L58] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L63] unsigned char stepLocal_2 = var_1_4; [L64] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=8589934574, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L65] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=8589934574, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] COND TRUE stepLocal_1 >= var_1_6 [L69] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L74] unsigned char stepLocal_5 = var_1_1; [L75] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L76] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L83] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L84] COND TRUE ! var_1_1 [L85] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=8589934574, var_1_15=2147483647, var_1_16=8589934590, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1091 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1087 mSDsluCounter, 2779 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1789 mSDsCounter, 665 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1986 IncrementalHoareTripleChecker+Invalid, 2651 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 665 mSolverCounterUnsat, 990 mSDtfsCounter, 1986 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1336 GetRequests, 1225 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=10, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 364 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 2029 NumberOfCodeBlocks, 2029 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2137 ConstructedInterpolants, 0 QuantifiedInterpolants, 10710 SizeOfPredicates, 17 NumberOfNonLiveVariables, 909 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 12458/12920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 08:33:22,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:33:24,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:33:24,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:33:24,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:33:24,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:33:24,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:33:24,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:33:24,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:33:24,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:33:24,763 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:33:24,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:33:24,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:33:24,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:33:24,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:33:24,765 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:33:24,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:33:24,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:33:24,768 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:33:24,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:33:24,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:33:24,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:33:24,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:33:24,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:33:24,770 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:33:24,770 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:33:24,770 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:33:24,770 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:33:24,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:33:24,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:33:24,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:33:24,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:33:24,771 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:33:24,771 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:33:24,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:33:24,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:33:24,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:33:24,772 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:33:24,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:33:24,772 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:33:24,773 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:33:24,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:33:24,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:33:24,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:33:24,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:33:24,775 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:33:24,775 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d [2024-10-24 08:33:25,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:33:25,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:33:25,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:33:25,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:33:25,053 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:33:25,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i [2024-10-24 08:33:26,392 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:33:26,545 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:33:26,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i [2024-10-24 08:33:26,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3c67691/ca0e5057486c4a008528425f028b639d/FLAG649ee2a54 [2024-10-24 08:33:26,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3c67691/ca0e5057486c4a008528425f028b639d [2024-10-24 08:33:26,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:33:26,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:33:26,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:33:26,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:33:26,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:33:26,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5281a5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26, skipping insertion in model container [2024-10-24 08:33:26,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:33:26,738 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i[912,925] [2024-10-24 08:33:26,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:33:26,804 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:33:26,813 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-4.i[912,925] [2024-10-24 08:33:26,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:33:26,860 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:33:26,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26 WrapperNode [2024-10-24 08:33:26,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:33:26,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:33:26,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:33:26,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:33:26,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,906 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-10-24 08:33:26,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:33:26,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:33:26,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:33:26,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:33:26,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,941 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:33:26,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:33:26,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:33:26,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:33:26,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:33:26,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26" (1/1) ... [2024-10-24 08:33:26,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:33:26,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:33:26,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:33:27,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:33:27,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:33:27,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:33:27,038 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:33:27,038 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:33:27,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:33:27,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:33:27,111 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:33:27,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:33:27,533 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 08:33:27,533 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:33:27,576 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:33:27,576 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:33:27,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:33:27 BoogieIcfgContainer [2024-10-24 08:33:27,577 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:33:27,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:33:27,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:33:27,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:33:27,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:33:26" (1/3) ... [2024-10-24 08:33:27,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53017222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:33:27, skipping insertion in model container [2024-10-24 08:33:27,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:33:26" (2/3) ... [2024-10-24 08:33:27,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53017222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:33:27, skipping insertion in model container [2024-10-24 08:33:27,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:33:27" (3/3) ... [2024-10-24 08:33:27,588 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-4.i [2024-10-24 08:33:27,601 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:33:27,601 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:33:27,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:33:27,663 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;@2a14eed3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:33:27,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:33:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:33:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 08:33:27,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:27,682 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:27,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:27,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash -279030631, now seen corresponding path program 1 times [2024-10-24 08:33:27,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:33:27,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916340309] [2024-10-24 08:33:27,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:27,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:27,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:33:27,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:33:27,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 08:33:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:27,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:33:27,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:33:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-10-24 08:33:27,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:33:27,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:33:27,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916340309] [2024-10-24 08:33:27,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916340309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:33:27,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:33:27,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:33:27,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756922744] [2024-10-24 08:33:27,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:33:27,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:33:27,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:33:27,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:33:27,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:33:27,989 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:28,132 INFO L93 Difference]: Finished difference Result 113 states and 200 transitions. [2024-10-24 08:33:28,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:33:28,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-10-24 08:33:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:28,148 INFO L225 Difference]: With dead ends: 113 [2024-10-24 08:33:28,148 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 08:33:28,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:33:28,153 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:28,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:33:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 08:33:28,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-24 08:33:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:33:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2024-10-24 08:33:28,184 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 125 [2024-10-24 08:33:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:28,184 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2024-10-24 08:33:28,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2024-10-24 08:33:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 08:33:28,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:28,186 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:28,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 08:33:28,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:28,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:28,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:28,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1621605454, now seen corresponding path program 1 times [2024-10-24 08:33:28,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:33:28,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796189055] [2024-10-24 08:33:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:28,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:28,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:33:28,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:33:28,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 08:33:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:28,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:33:28,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:33:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:33:29,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:33:29,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:33:29,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796189055] [2024-10-24 08:33:29,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796189055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:33:29,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:33:29,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:33:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075893957] [2024-10-24 08:33:29,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:33:29,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:33:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:33:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:33:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:33:29,308 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:30,069 INFO L93 Difference]: Finished difference Result 167 states and 254 transitions. [2024-10-24 08:33:30,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:33:30,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-10-24 08:33:30,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:30,081 INFO L225 Difference]: With dead ends: 167 [2024-10-24 08:33:30,081 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 08:33:30,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:33:30,082 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:30,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 259 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 08:33:30,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 08:33:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2024-10-24 08:33:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 53 states have internal predecessors, (66), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 08:33:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-10-24 08:33:30,100 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 126 [2024-10-24 08:33:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:30,101 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-10-24 08:33:30,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-10-24 08:33:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 08:33:30,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:30,102 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:30,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 08:33:30,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:30,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:30,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1972297264, now seen corresponding path program 1 times [2024-10-24 08:33:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:33:30,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905990862] [2024-10-24 08:33:30,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:30,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:30,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:33:30,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:33:30,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 08:33:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:30,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 08:33:30,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:33:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 179 proven. 99 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-10-24 08:33:31,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:33:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 102 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-10-24 08:33:31,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:33:31,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905990862] [2024-10-24 08:33:31,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905990862] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:33:31,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 08:33:31,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-10-24 08:33:31,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795747872] [2024-10-24 08:33:31,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 08:33:31,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 08:33:31,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:33:31,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 08:33:31,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-24 08:33:31,360 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-24 08:33:32,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:32,316 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2024-10-24 08:33:32,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 08:33:32,317 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 126 [2024-10-24 08:33:32,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:32,318 INFO L225 Difference]: With dead ends: 191 [2024-10-24 08:33:32,318 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 08:33:32,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-10-24 08:33:32,320 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 44 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:32,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 240 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 08:33:32,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 08:33:32,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2024-10-24 08:33:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 68 states have internal predecessors, (75), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 08:33:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 155 transitions. [2024-10-24 08:33:32,336 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 155 transitions. Word has length 126 [2024-10-24 08:33:32,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:32,337 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 155 transitions. [2024-10-24 08:33:32,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-24 08:33:32,337 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 155 transitions. [2024-10-24 08:33:32,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 08:33:32,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:32,338 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:32,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 08:33:32,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:32,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:32,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:32,543 INFO L85 PathProgramCache]: Analyzing trace with hash 519772408, now seen corresponding path program 1 times [2024-10-24 08:33:32,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:33:32,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094729500] [2024-10-24 08:33:32,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:32,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:32,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:33:32,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:33:32,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 08:33:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:32,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:33:32,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:33:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-10-24 08:33:32,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:33:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 08:33:33,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:33:33,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094729500] [2024-10-24 08:33:33,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094729500] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:33:33,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 08:33:33,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-10-24 08:33:33,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048243220] [2024-10-24 08:33:33,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 08:33:33,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 08:33:33,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:33:33,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 08:33:33,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:33:33,044 INFO L87 Difference]: Start difference. First operand 115 states and 155 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 08:33:33,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:33,949 INFO L93 Difference]: Finished difference Result 256 states and 340 transitions. [2024-10-24 08:33:33,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 08:33:33,950 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 127 [2024-10-24 08:33:33,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:33,952 INFO L225 Difference]: With dead ends: 256 [2024-10-24 08:33:33,952 INFO L226 Difference]: Without dead ends: 189 [2024-10-24 08:33:33,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-10-24 08:33:33,953 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 87 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:33,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 315 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 08:33:33,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-24 08:33:33,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2024-10-24 08:33:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 99 states have (on average 1.101010101010101) internal successors, (109), 99 states have internal predecessors, (109), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 08:33:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 229 transitions. [2024-10-24 08:33:33,972 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 229 transitions. Word has length 127 [2024-10-24 08:33:33,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:33,972 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 229 transitions. [2024-10-24 08:33:33,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 08:33:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 229 transitions. [2024-10-24 08:33:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 08:33:33,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:33,974 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:33,983 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 (5)] Ended with exit code 0 [2024-10-24 08:33:34,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:34,178 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:34,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:34,179 INFO L85 PathProgramCache]: Analyzing trace with hash 519831990, now seen corresponding path program 1 times [2024-10-24 08:33:34,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:33:34,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756132259] [2024-10-24 08:33:34,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:34,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:34,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:33:34,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:33:34,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 08:33:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:34,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:33:34,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:33:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-10-24 08:33:34,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:33:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 08:33:34,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:33:34,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756132259] [2024-10-24 08:33:34,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756132259] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:33:34,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 08:33:34,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2024-10-24 08:33:34,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354356450] [2024-10-24 08:33:34,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 08:33:34,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 08:33:34,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:33:34,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 08:33:34,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:33:34,967 INFO L87 Difference]: Start difference. First operand 169 states and 229 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-24 08:33:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:35,587 INFO L93 Difference]: Finished difference Result 257 states and 340 transitions. [2024-10-24 08:33:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 08:33:35,596 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 127 [2024-10-24 08:33:35,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:35,599 INFO L225 Difference]: With dead ends: 257 [2024-10-24 08:33:35,599 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 08:33:35,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-10-24 08:33:35,600 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 42 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:35,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 167 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:33:35,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 08:33:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2024-10-24 08:33:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 62 states have (on average 1.0806451612903225) internal successors, (67), 62 states have internal predecessors, (67), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 08:33:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2024-10-24 08:33:35,621 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 127 [2024-10-24 08:33:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:35,622 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2024-10-24 08:33:35,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-24 08:33:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2024-10-24 08:33:35,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 08:33:35,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:35,623 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:35,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 08:33:35,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:35,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:35,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:35,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2018242555, now seen corresponding path program 1 times [2024-10-24 08:33:35,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:33:35,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290248941] [2024-10-24 08:33:35,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:35,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:35,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:33:35,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:33:35,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 08:33:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:35,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 08:33:35,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:33:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:33:36,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:33:36,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:33:36,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290248941] [2024-10-24 08:33:36,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290248941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:33:36,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:33:36,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:33:36,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675354830] [2024-10-24 08:33:36,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:33:36,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:33:36,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:33:36,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:33:36,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:33:36,142 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:36,535 INFO L93 Difference]: Finished difference Result 230 states and 309 transitions. [2024-10-24 08:33:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:33:36,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2024-10-24 08:33:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:36,537 INFO L225 Difference]: With dead ends: 230 [2024-10-24 08:33:36,537 INFO L226 Difference]: Without dead ends: 169 [2024-10-24 08:33:36,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:33:36,538 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 98 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:36,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 189 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 08:33:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-24 08:33:36,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2024-10-24 08:33:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 97 states have internal predecessors, (104), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 08:33:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 224 transitions. [2024-10-24 08:33:36,553 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 224 transitions. Word has length 127 [2024-10-24 08:33:36,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:36,553 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 224 transitions. [2024-10-24 08:33:36,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:33:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 224 transitions. [2024-10-24 08:33:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 08:33:36,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:36,554 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:36,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 08:33:36,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:36,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:36,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:36,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1208895929, now seen corresponding path program 1 times [2024-10-24 08:33:36,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:33:36,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950760072] [2024-10-24 08:33:36,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:36,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:36,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:33:36,759 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:33:36,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 08:33:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:36,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 08:33:36,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:33:37,428 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 387 proven. 33 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-24 08:33:37,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:33:37,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:33:37,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950760072] [2024-10-24 08:33:37,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950760072] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:33:37,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2115968535] [2024-10-24 08:33:37,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:37,533 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 08:33:37,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 08:33:37,535 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 08:33:37,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-24 08:33:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:37,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 08:33:37,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:33:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 438 proven. 57 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-24 08:33:38,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:33:38,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2115968535] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:33:38,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 08:33:38,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-10-24 08:33:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827142864] [2024-10-24 08:33:38,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 08:33:38,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 08:33:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:33:38,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 08:33:38,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-24 08:33:38,869 INFO L87 Difference]: Start difference. First operand 167 states and 224 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-10-24 08:33:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:33:40,983 INFO L93 Difference]: Finished difference Result 256 states and 330 transitions. [2024-10-24 08:33:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-24 08:33:40,984 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) Word has length 127 [2024-10-24 08:33:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:33:40,985 INFO L225 Difference]: With dead ends: 256 [2024-10-24 08:33:40,985 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 08:33:40,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-10-24 08:33:40,987 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 160 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 08:33:40,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 244 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 08:33:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 08:33:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2024-10-24 08:33:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 08:33:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 157 transitions. [2024-10-24 08:33:41,007 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 157 transitions. Word has length 127 [2024-10-24 08:33:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:33:41,008 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 157 transitions. [2024-10-24 08:33:41,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-10-24 08:33:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 157 transitions. [2024-10-24 08:33:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 08:33:41,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:33:41,009 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:33:41,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-10-24 08:33:41,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-24 08:33:41,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:41,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:33:41,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:33:41,411 INFO L85 PathProgramCache]: Analyzing trace with hash -761419599, now seen corresponding path program 1 times [2024-10-24 08:33:41,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:33:41,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696072507] [2024-10-24 08:33:41,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:33:41,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:33:41,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:33:41,414 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:33:41,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 08:33:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:33:41,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 08:33:41,542 INFO L278 TraceCheckSpWp]: Computing forward predicates...