./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.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 17124c627a77300cd44285b9c4c316438e4d73c0a011ab8330c0a1114bb82733 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:54:48,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:54:48,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:54:48,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:54:48,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:54:48,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:54:48,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:54:48,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:54:48,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:54:48,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:54:48,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:54:48,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:54:48,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:54:48,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:54:48,885 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:54:48,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:54:48,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:54:48,887 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:54:48,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:54:48,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:54:48,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:54:48,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:54:48,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:54:48,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:54:48,889 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:54:48,890 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:54:48,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:54:48,891 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:54:48,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:54:48,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:54:48,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:54:48,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:54:48,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:54:48,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:54:48,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:54:48,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:54:48,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:54:48,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:54:48,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:54:48,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:54:48,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:54:48,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:54:48,898 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 -> 17124c627a77300cd44285b9c4c316438e4d73c0a011ab8330c0a1114bb82733 [2024-11-12 01:54:49,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:54:49,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:54:49,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:54:49,191 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:54:49,191 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:54:49,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2024-11-12 01:54:50,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:54:51,013 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:54:51,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2024-11-12 01:54:51,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3cf9f62/fb0fb52b437c435680b36f620ff38ab3/FLAG311c15a25 [2024-11-12 01:54:51,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3cf9f62/fb0fb52b437c435680b36f620ff38ab3 [2024-11-12 01:54:51,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:54:51,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:54:51,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:54:51,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:54:51,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:54:51,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155a93e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51, skipping insertion in model container [2024-11-12 01:54:51,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:54:51,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i[915,928] [2024-11-12 01:54:51,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:54:51,391 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:54:51,405 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-10.i[915,928] [2024-11-12 01:54:51,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:54:51,474 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:54:51,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51 WrapperNode [2024-11-12 01:54:51,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:54:51,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:54:51,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:54:51,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:54:51,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,545 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 214 [2024-11-12 01:54:51,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:54:51,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:54:51,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:54:51,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:54:51,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,594 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:54:51,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:54:51,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:54:51,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:54:51,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:54:51,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51" (1/1) ... [2024-11-12 01:54:51,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:54:51,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:54:51,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:54:51,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:54:51,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:54:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:54:51,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:54:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:54:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:54:51,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:54:51,850 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:54:51,852 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:54:52,334 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-12 01:54:52,335 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:54:52,355 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:54:52,355 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:54:52,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:54:52 BoogieIcfgContainer [2024-11-12 01:54:52,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:54:52,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:54:52,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:54:52,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:54:52,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:54:51" (1/3) ... [2024-11-12 01:54:52,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255ffc30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:54:52, skipping insertion in model container [2024-11-12 01:54:52,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:54:51" (2/3) ... [2024-11-12 01:54:52,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255ffc30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:54:52, skipping insertion in model container [2024-11-12 01:54:52,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:54:52" (3/3) ... [2024-11-12 01:54:52,369 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-10.i [2024-11-12 01:54:52,387 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:54:52,387 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:54:52,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:54:52,474 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;@168a9a74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:54:52,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:54:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 64 states have (on average 1.40625) internal successors, (90), 65 states have internal predecessors, (90), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 01:54:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 01:54:52,495 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:54:52,496 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:54:52,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:54:52,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:54:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2101394287, now seen corresponding path program 1 times [2024-11-12 01:54:52,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:54:52,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459818662] [2024-11-12 01:54:52,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:54:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:54:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:52,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:54:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:52,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:54:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:52,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:54:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:52,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:54:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:52,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:54:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:52,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:54:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:52,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:54:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:52,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:54:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:52,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:54:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:52,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:54:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:52,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:54:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:52,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:54:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:54:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:54:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:54:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:54:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:54:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:54:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:54:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:54:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:54:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:54:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:54:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:54:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:54:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 01:54:53,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:54:53,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459818662] [2024-11-12 01:54:53,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459818662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:54:53,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:54:53,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:54:53,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415221887] [2024-11-12 01:54:53,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:54:53,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:54:53,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:54:53,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:54:53,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:54:53,165 INFO L87 Difference]: Start difference. First operand has 92 states, 64 states have (on average 1.40625) internal successors, (90), 65 states have internal predecessors, (90), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 01:54:53,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:54:53,213 INFO L93 Difference]: Finished difference Result 177 states and 299 transitions. [2024-11-12 01:54:53,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:54:53,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2024-11-12 01:54:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:54:53,228 INFO L225 Difference]: With dead ends: 177 [2024-11-12 01:54:53,229 INFO L226 Difference]: Without dead ends: 88 [2024-11-12 01:54:53,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:54:53,242 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:54:53,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:54:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-12 01:54:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-12 01:54:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 01:54:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 132 transitions. [2024-11-12 01:54:53,297 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 132 transitions. Word has length 164 [2024-11-12 01:54:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:54:53,298 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 132 transitions. [2024-11-12 01:54:53,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 01:54:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 132 transitions. [2024-11-12 01:54:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 01:54:53,302 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:54:53,303 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:54:53,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:54:53,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:54:53,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:54:53,307 INFO L85 PathProgramCache]: Analyzing trace with hash -615042911, now seen corresponding path program 1 times [2024-11-12 01:54:53,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:54:53,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582044665] [2024-11-12 01:54:53,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:54:53,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:54:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:54:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:54:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:54:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:54:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:53,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:54:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:54:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:54:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:54:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:54:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:54:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:54:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:54:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:54:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:54:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:54:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:54:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:54:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:54:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:54:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:54:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:54:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:54:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:54:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:54:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:54:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 01:54:54,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:54:54,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582044665] [2024-11-12 01:54:54,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582044665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:54:54,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:54:54,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:54:54,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204257855] [2024-11-12 01:54:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:54:54,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:54:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:54:54,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:54:54,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:54:54,166 INFO L87 Difference]: Start difference. First operand 88 states and 132 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 01:54:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:54:54,459 INFO L93 Difference]: Finished difference Result 259 states and 391 transitions. [2024-11-12 01:54:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:54:54,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2024-11-12 01:54:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:54:54,473 INFO L225 Difference]: With dead ends: 259 [2024-11-12 01:54:54,473 INFO L226 Difference]: Without dead ends: 174 [2024-11-12 01:54:54,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 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-11-12 01:54:54,475 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 94 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:54:54,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 499 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:54:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-12 01:54:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 140. [2024-11-12 01:54:54,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 01:54:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 212 transitions. [2024-11-12 01:54:54,528 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 212 transitions. Word has length 165 [2024-11-12 01:54:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:54:54,531 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 212 transitions. [2024-11-12 01:54:54,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 01:54:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 212 transitions. [2024-11-12 01:54:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-12 01:54:54,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:54:54,534 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:54:54,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:54:54,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:54:54,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:54:54,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2087881671, now seen corresponding path program 1 times [2024-11-12 01:54:54,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:54:54,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649250669] [2024-11-12 01:54:54,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:54:54,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:54:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:54:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:54:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:54:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:54:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:54:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:54:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:54:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:54:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:54:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:54:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:54:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:54:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:54:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:54:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:54:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:54:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:54:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:54:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:54:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:54:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:54:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:54:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:54:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:54:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:54:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 01:54:54,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:54:54,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649250669] [2024-11-12 01:54:54,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649250669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:54:54,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:54:54,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:54:54,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951106331] [2024-11-12 01:54:54,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:54:54,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:54:54,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:54:54,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:54:54,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:54:54,951 INFO L87 Difference]: Start difference. First operand 140 states and 212 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 01:54:55,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:54:55,140 INFO L93 Difference]: Finished difference Result 237 states and 353 transitions. [2024-11-12 01:54:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:54:55,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2024-11-12 01:54:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:54:55,144 INFO L225 Difference]: With dead ends: 237 [2024-11-12 01:54:55,144 INFO L226 Difference]: Without dead ends: 150 [2024-11-12 01:54:55,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:54:55,147 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 112 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:54:55,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 224 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 01:54:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-12 01:54:55,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-12 01:54:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.263157894736842) internal successors, (120), 95 states have internal predecessors, (120), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 01:54:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 220 transitions. [2024-11-12 01:54:55,183 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 220 transitions. Word has length 166 [2024-11-12 01:54:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:54:55,184 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 220 transitions. [2024-11-12 01:54:55,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 01:54:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 220 transitions. [2024-11-12 01:54:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 01:54:55,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:54:55,189 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:54:55,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:54:55,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:54:55,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:54:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 228644080, now seen corresponding path program 1 times [2024-11-12 01:54:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:54:55,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666956802] [2024-11-12 01:54:55,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:54:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:54:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:54:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:54:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:54:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:54:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:54:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:54:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:54:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:54:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:54:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:54:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:54:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:54:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:54:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:54:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:54:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:54:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:54:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:54:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:54:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:54:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:54:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:54:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:54:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:54:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:54:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 01:54:55,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:54:55,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666956802] [2024-11-12 01:54:55,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666956802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:54:55,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:54:55,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:54:55,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187510024] [2024-11-12 01:54:55,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:54:55,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:54:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:54:55,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:54:55,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:54:55,609 INFO L87 Difference]: Start difference. First operand 150 states and 220 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 01:54:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:54:55,761 INFO L93 Difference]: Finished difference Result 244 states and 359 transitions. [2024-11-12 01:54:55,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:54:55,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-12 01:54:55,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:54:55,763 INFO L225 Difference]: With dead ends: 244 [2024-11-12 01:54:55,764 INFO L226 Difference]: Without dead ends: 152 [2024-11-12 01:54:55,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:54:55,769 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 107 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:54:55,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 304 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 01:54:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-12 01:54:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2024-11-12 01:54:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.263157894736842) internal successors, (120), 95 states have internal predecessors, (120), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 01:54:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 220 transitions. [2024-11-12 01:54:55,805 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 220 transitions. Word has length 167 [2024-11-12 01:54:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:54:55,805 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 220 transitions. [2024-11-12 01:54:55,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 01:54:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 220 transitions. [2024-11-12 01:54:55,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 01:54:55,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:54:55,810 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:54:55,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 01:54:55,810 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:54:55,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:54:55,811 INFO L85 PathProgramCache]: Analyzing trace with hash -404164286, now seen corresponding path program 1 times [2024-11-12 01:54:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:54:55,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67204177] [2024-11-12 01:54:55,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:54:55,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:54:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:54:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:54:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:54:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:54:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:54:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:55,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:54:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:54:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:54:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:54:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:54:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:54:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:54:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:54:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:54:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:54:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:54:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:54:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:54:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:54:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:54:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:54:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:54:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:54:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:54:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:54:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:54:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 01:54:56,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:54:56,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67204177] [2024-11-12 01:54:56,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67204177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:54:56,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:54:56,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:54:56,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347989654] [2024-11-12 01:54:56,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:54:56,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:54:56,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:54:56,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:54:56,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:54:56,082 INFO L87 Difference]: Start difference. First operand 150 states and 220 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 01:54:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:54:56,114 INFO L93 Difference]: Finished difference Result 242 states and 355 transitions. [2024-11-12 01:54:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:54:56,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-11-12 01:54:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:54:56,118 INFO L225 Difference]: With dead ends: 242 [2024-11-12 01:54:56,118 INFO L226 Difference]: Without dead ends: 150 [2024-11-12 01:54:56,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:54:56,122 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 124 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:54:56,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 267 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:54:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-12 01:54:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-12 01:54:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 95 states have internal predecessors, (118), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 01:54:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 218 transitions. [2024-11-12 01:54:56,150 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 218 transitions. Word has length 167 [2024-11-12 01:54:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:54:56,151 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 218 transitions. [2024-11-12 01:54:56,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-12 01:54:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 218 transitions. [2024-11-12 01:54:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 01:54:56,152 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:54:56,153 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:54:56,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 01:54:56,153 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:54:56,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:54:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash 18537540, now seen corresponding path program 1 times [2024-11-12 01:54:56,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:54:56,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295360318] [2024-11-12 01:54:56,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:54:56,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:54:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:55:59,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:55:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:55:59,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:55:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:55:59,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:55:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:55:59,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:55:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:55:59,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:55:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:55:59,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:55:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:55:59,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:55:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:55:59,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:55:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:55:59,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:56:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:56:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:56:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:56:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:56:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:56:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:56:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:56:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:56:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:56:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:56:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:56:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:56:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:56:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:56:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:56:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:56:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:56:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 01:56:00,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:56:00,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295360318] [2024-11-12 01:56:00,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295360318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:56:00,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:56:00,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 01:56:00,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692092368] [2024-11-12 01:56:00,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:56:00,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 01:56:00,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:56:00,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 01:56:00,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-12 01:56:00,077 INFO L87 Difference]: Start difference. First operand 150 states and 218 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 01:56:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:56:03,049 INFO L93 Difference]: Finished difference Result 425 states and 605 transitions. [2024-11-12 01:56:03,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 01:56:03,050 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-12 01:56:03,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:56:03,053 INFO L225 Difference]: With dead ends: 425 [2024-11-12 01:56:03,056 INFO L226 Difference]: Without dead ends: 335 [2024-11-12 01:56:03,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2024-11-12 01:56:03,060 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 922 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:56:03,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 640 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 01:56:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-12 01:56:03,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 177. [2024-11-12 01:56:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 121 states have internal predecessors, (154), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 01:56:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 254 transitions. [2024-11-12 01:56:03,090 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 254 transitions. Word has length 167 [2024-11-12 01:56:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:56:03,091 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 254 transitions. [2024-11-12 01:56:03,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 01:56:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 254 transitions. [2024-11-12 01:56:03,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 01:56:03,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:56:03,093 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:56:03,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 01:56:03,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:56:03,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:56:03,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1166662980, now seen corresponding path program 1 times [2024-11-12 01:56:03,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:56:03,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54985354] [2024-11-12 01:56:03,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:56:03,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:56:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat