./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-1.c -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 d4710f8f3a918a0191222414f5c33a367ff98c09c2e8598fa3213223c4c35dba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:54:31,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:54:31,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:54:31,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:54:31,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:54:31,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:54:31,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:54:31,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:54:31,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:54:31,650 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:54:31,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:54:31,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:54:31,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:54:31,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:54:31,652 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:54:31,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:54:31,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:54:31,655 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:54:31,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:54:31,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:54:31,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:54:31,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:54:31,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:54:31,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:54:31,662 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:54:31,662 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:54:31,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:54:31,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:54:31,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:54:31,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:54:31,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:54:31,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:54:31,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:54:31,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:54:31,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:54:31,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:54:31,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:54:31,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:54:31,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:54:31,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:54:31,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:54:31,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:54:31,668 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 -> d4710f8f3a918a0191222414f5c33a367ff98c09c2e8598fa3213223c4c35dba [2024-10-12 19:54:31,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:54:32,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:54:32,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:54:32,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:54:32,029 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:54:32,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-1.c [2024-10-12 19:54:33,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:54:33,690 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:54:33,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-1.c [2024-10-12 19:54:33,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0d4b24d/697307dc88034eaeaa4345252af89ee1/FLAG2e191774b [2024-10-12 19:54:33,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0d4b24d/697307dc88034eaeaa4345252af89ee1 [2024-10-12 19:54:33,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:54:33,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:54:33,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:54:33,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:54:33,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:54:33,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:54:33" (1/1) ... [2024-10-12 19:54:33,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@588343b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:33, skipping insertion in model container [2024-10-12 19:54:33,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:54:33" (1/1) ... [2024-10-12 19:54:33,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:54:33,942 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-1.c[671,684] [2024-10-12 19:54:34,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:54:34,083 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:54:34,096 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-1.c[671,684] [2024-10-12 19:54:34,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:54:34,174 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:54:34,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34 WrapperNode [2024-10-12 19:54:34,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:54:34,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:54:34,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:54:34,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:54:34,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34" (1/1) ... [2024-10-12 19:54:34,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34" (1/1) ... [2024-10-12 19:54:34,225 INFO L138 Inliner]: procedures = 36, calls = 43, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 399 [2024-10-12 19:54:34,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:54:34,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:54:34,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:54:34,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:54:34,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34" (1/1) ... [2024-10-12 19:54:34,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34" (1/1) ... [2024-10-12 19:54:34,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34" (1/1) ... [2024-10-12 19:54:34,256 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 19:54:34,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34" (1/1) ... [2024-10-12 19:54:34,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34" (1/1) ... [2024-10-12 19:54:34,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34" (1/1) ... [2024-10-12 19:54:34,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34" (1/1) ... [2024-10-12 19:54:34,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34" (1/1) ... [2024-10-12 19:54:34,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34" (1/1) ... [2024-10-12 19:54:34,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:54:34,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:54:34,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:54:34,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:54:34,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34" (1/1) ... [2024-10-12 19:54:34,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:54:34,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:34,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:54:34,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:54:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:54:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 19:54:34,405 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 19:54:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 19:54:34,405 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 19:54:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 19:54:34,405 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 19:54:34,405 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 19:54:34,406 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 19:54:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 19:54:34,406 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 19:54:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:54:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 19:54:34,406 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 19:54:34,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:54:34,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:54:34,504 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:54:34,507 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:54:35,018 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-10-12 19:54:35,018 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:54:35,071 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:54:35,071 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-12 19:54:35,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:54:35 BoogieIcfgContainer [2024-10-12 19:54:35,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:54:35,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:54:35,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:54:35,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:54:35,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:54:33" (1/3) ... [2024-10-12 19:54:35,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c6ede7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:54:35, skipping insertion in model container [2024-10-12 19:54:35,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:34" (2/3) ... [2024-10-12 19:54:35,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c6ede7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:54:35, skipping insertion in model container [2024-10-12 19:54:35,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:54:35" (3/3) ... [2024-10-12 19:54:35,087 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.04.cil-1.c [2024-10-12 19:54:35,106 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:54:35,107 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:54:35,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:54:35,183 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;@49751f15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:54:35,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:54:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 138 states have (on average 1.6884057971014492) internal successors, (233), 140 states have internal predecessors, (233), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 19:54:35,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:54:35,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:35,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:35,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:35,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:35,206 INFO L85 PathProgramCache]: Analyzing trace with hash -350002983, now seen corresponding path program 1 times [2024-10-12 19:54:35,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:35,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060785463] [2024-10-12 19:54:35,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:35,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:54:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:54:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:54:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:54:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:35,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:35,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060785463] [2024-10-12 19:54:35,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060785463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:35,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:35,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:54:35,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918343736] [2024-10-12 19:54:35,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:35,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:54:35,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:35,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:54:35,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:54:35,798 INFO L87 Difference]: Start difference. First operand has 164 states, 138 states have (on average 1.6884057971014492) internal successors, (233), 140 states have internal predecessors, (233), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:36,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:36,790 INFO L93 Difference]: Finished difference Result 370 states and 613 transitions. [2024-10-12 19:54:36,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:54:36,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2024-10-12 19:54:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:36,806 INFO L225 Difference]: With dead ends: 370 [2024-10-12 19:54:36,806 INFO L226 Difference]: Without dead ends: 212 [2024-10-12 19:54:36,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:54:36,815 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 407 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:36,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 297 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:54:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-12 19:54:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 162. [2024-10-12 19:54:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.5693430656934306) internal successors, (215), 138 states have internal predecessors, (215), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 19:54:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 251 transitions. [2024-10-12 19:54:36,888 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 251 transitions. Word has length 80 [2024-10-12 19:54:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:36,889 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 251 transitions. [2024-10-12 19:54:36,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 251 transitions. [2024-10-12 19:54:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:54:36,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:36,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:36,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:54:36,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:36,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:36,897 INFO L85 PathProgramCache]: Analyzing trace with hash 617347671, now seen corresponding path program 1 times [2024-10-12 19:54:36,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:36,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892995307] [2024-10-12 19:54:36,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:36,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:54:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:54:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:54:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:54:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:37,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:37,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892995307] [2024-10-12 19:54:37,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892995307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:37,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:37,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:54:37,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290868204] [2024-10-12 19:54:37,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:37,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:54:37,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:37,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:54:37,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:54:37,181 INFO L87 Difference]: Start difference. First operand 162 states and 251 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:38,444 INFO L93 Difference]: Finished difference Result 569 states and 905 transitions. [2024-10-12 19:54:38,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:54:38,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2024-10-12 19:54:38,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:38,454 INFO L225 Difference]: With dead ends: 569 [2024-10-12 19:54:38,458 INFO L226 Difference]: Without dead ends: 417 [2024-10-12 19:54:38,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:54:38,461 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 605 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:38,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 491 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:54:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-12 19:54:38,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 318. [2024-10-12 19:54:38,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 273 states have (on average 1.5787545787545787) internal successors, (431), 275 states have internal predecessors, (431), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-10-12 19:54:38,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 496 transitions. [2024-10-12 19:54:38,516 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 496 transitions. Word has length 80 [2024-10-12 19:54:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:38,517 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 496 transitions. [2024-10-12 19:54:38,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 496 transitions. [2024-10-12 19:54:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:54:38,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:38,521 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:38,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:54:38,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:38,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:38,524 INFO L85 PathProgramCache]: Analyzing trace with hash -800451433, now seen corresponding path program 1 times [2024-10-12 19:54:38,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:38,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047701646] [2024-10-12 19:54:38,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:38,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:38,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:38,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:54:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:38,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:54:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:38,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:54:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:38,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:54:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:38,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:38,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:38,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047701646] [2024-10-12 19:54:38,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047701646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:38,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:38,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:54:38,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113581229] [2024-10-12 19:54:38,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:38,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:54:38,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:38,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:54:38,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:38,761 INFO L87 Difference]: Start difference. First operand 318 states and 496 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:40,332 INFO L93 Difference]: Finished difference Result 934 states and 1479 transitions. [2024-10-12 19:54:40,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:54:40,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2024-10-12 19:54:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:40,338 INFO L225 Difference]: With dead ends: 934 [2024-10-12 19:54:40,338 INFO L226 Difference]: Without dead ends: 626 [2024-10-12 19:54:40,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:54:40,341 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 610 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:40,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 916 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:54:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-10-12 19:54:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 463. [2024-10-12 19:54:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 398 states have (on average 1.57035175879397) internal successors, (625), 401 states have internal predecessors, (625), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-10-12 19:54:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 718 transitions. [2024-10-12 19:54:40,401 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 718 transitions. Word has length 80 [2024-10-12 19:54:40,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:40,401 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 718 transitions. [2024-10-12 19:54:40,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 718 transitions. [2024-10-12 19:54:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:54:40,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:40,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:40,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:54:40,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:40,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:40,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2016605159, now seen corresponding path program 1 times [2024-10-12 19:54:40,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:40,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401353720] [2024-10-12 19:54:40,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:40,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:54:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:54:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:54:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:54:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:40,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:40,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401353720] [2024-10-12 19:54:40,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401353720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:40,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:40,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:54:40,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845143894] [2024-10-12 19:54:40,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:40,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:54:40,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:40,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:54:40,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:40,668 INFO L87 Difference]: Start difference. First operand 463 states and 718 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:42,072 INFO L93 Difference]: Finished difference Result 1468 states and 2317 transitions. [2024-10-12 19:54:42,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:54:42,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2024-10-12 19:54:42,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:42,082 INFO L225 Difference]: With dead ends: 1468 [2024-10-12 19:54:42,082 INFO L226 Difference]: Without dead ends: 1015 [2024-10-12 19:54:42,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:54:42,088 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 656 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:42,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 612 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:54:42,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-10-12 19:54:42,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 754. [2024-10-12 19:54:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 649 states have (on average 1.5624036979969183) internal successors, (1014), 654 states have internal predecessors, (1014), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-12 19:54:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1167 transitions. [2024-10-12 19:54:42,170 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1167 transitions. Word has length 80 [2024-10-12 19:54:42,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:42,171 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1167 transitions. [2024-10-12 19:54:42,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:42,172 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1167 transitions. [2024-10-12 19:54:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:54:42,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:42,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:42,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:54:42,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:42,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1546394711, now seen corresponding path program 1 times [2024-10-12 19:54:42,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:42,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601011773] [2024-10-12 19:54:42,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:42,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:42,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:42,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:54:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:42,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:54:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:42,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:54:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:42,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:54:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:42,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:42,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601011773] [2024-10-12 19:54:42,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601011773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:42,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:42,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:54:42,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830649387] [2024-10-12 19:54:42,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:42,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:54:42,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:42,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:54:42,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:42,370 INFO L87 Difference]: Start difference. First operand 754 states and 1167 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:43,092 INFO L93 Difference]: Finished difference Result 1749 states and 2759 transitions. [2024-10-12 19:54:43,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:54:43,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2024-10-12 19:54:43,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:43,099 INFO L225 Difference]: With dead ends: 1749 [2024-10-12 19:54:43,100 INFO L226 Difference]: Without dead ends: 1005 [2024-10-12 19:54:43,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:54:43,103 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 518 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:43,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 385 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:54:43,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2024-10-12 19:54:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 754. [2024-10-12 19:54:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 649 states have (on average 1.5546995377503852) internal successors, (1009), 654 states have internal predecessors, (1009), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-12 19:54:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1162 transitions. [2024-10-12 19:54:43,171 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1162 transitions. Word has length 80 [2024-10-12 19:54:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:43,172 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1162 transitions. [2024-10-12 19:54:43,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1162 transitions. [2024-10-12 19:54:43,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:54:43,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:43,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:43,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:54:43,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:43,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash -139785127, now seen corresponding path program 1 times [2024-10-12 19:54:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:43,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070235422] [2024-10-12 19:54:43,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:43,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:43,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:43,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:54:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:43,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:54:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:54:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:43,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:54:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:43,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:43,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070235422] [2024-10-12 19:54:43,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070235422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:43,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:43,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:54:43,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598351711] [2024-10-12 19:54:43,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:43,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:54:43,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:43,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:54:43,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:43,341 INFO L87 Difference]: Start difference. First operand 754 states and 1162 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:44,025 INFO L93 Difference]: Finished difference Result 1743 states and 2733 transitions. [2024-10-12 19:54:44,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:54:44,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2024-10-12 19:54:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:44,031 INFO L225 Difference]: With dead ends: 1743 [2024-10-12 19:54:44,031 INFO L226 Difference]: Without dead ends: 999 [2024-10-12 19:54:44,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:54:44,034 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 516 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:44,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 385 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:54:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2024-10-12 19:54:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 754. [2024-10-12 19:54:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 649 states have (on average 1.546995377503852) internal successors, (1004), 654 states have internal predecessors, (1004), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-12 19:54:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1157 transitions. [2024-10-12 19:54:44,086 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1157 transitions. Word has length 80 [2024-10-12 19:54:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:44,086 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1157 transitions. [2024-10-12 19:54:44,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1157 transitions. [2024-10-12 19:54:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:54:44,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:44,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:44,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:54:44,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:44,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash -194178025, now seen corresponding path program 1 times [2024-10-12 19:54:44,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:44,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717854764] [2024-10-12 19:54:44,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:44,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:44,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:54:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:44,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:54:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:44,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:54:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:44,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:54:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:44,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:44,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717854764] [2024-10-12 19:54:44,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717854764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:44,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:44,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:54:44,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009668233] [2024-10-12 19:54:44,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:44,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:54:44,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:44,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:54:44,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:44,254 INFO L87 Difference]: Start difference. First operand 754 states and 1157 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:45,851 INFO L93 Difference]: Finished difference Result 2704 states and 4202 transitions. [2024-10-12 19:54:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:54:45,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2024-10-12 19:54:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:45,862 INFO L225 Difference]: With dead ends: 2704 [2024-10-12 19:54:45,863 INFO L226 Difference]: Without dead ends: 1960 [2024-10-12 19:54:45,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:54:45,870 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 740 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:45,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 907 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:54:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2024-10-12 19:54:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1337. [2024-10-12 19:54:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 1156 states have (on average 1.5397923875432526) internal successors, (1780), 1165 states have internal predecessors, (1780), 118 states have call successors, (118), 54 states have call predecessors, (118), 62 states have return successors, (153), 125 states have call predecessors, (153), 118 states have call successors, (153) [2024-10-12 19:54:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 2051 transitions. [2024-10-12 19:54:45,990 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 2051 transitions. Word has length 80 [2024-10-12 19:54:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:45,991 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 2051 transitions. [2024-10-12 19:54:45,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 2051 transitions. [2024-10-12 19:54:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:54:45,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:45,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:45,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:54:45,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:45,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:45,997 INFO L85 PathProgramCache]: Analyzing trace with hash -611574631, now seen corresponding path program 1 times [2024-10-12 19:54:45,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:45,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800557424] [2024-10-12 19:54:45,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:45,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:46,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:46,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:54:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:46,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:54:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:46,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:54:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:46,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:54:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:46,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:46,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800557424] [2024-10-12 19:54:46,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800557424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:46,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:46,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:54:46,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241960751] [2024-10-12 19:54:46,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:46,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:54:46,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:46,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:54:46,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:46,167 INFO L87 Difference]: Start difference. First operand 1337 states and 2051 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:47,891 INFO L93 Difference]: Finished difference Result 4867 states and 7558 transitions. [2024-10-12 19:54:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:54:47,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2024-10-12 19:54:47,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:47,914 INFO L225 Difference]: With dead ends: 4867 [2024-10-12 19:54:47,914 INFO L226 Difference]: Without dead ends: 3540 [2024-10-12 19:54:47,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:54:47,922 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 616 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:47,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 903 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:54:47,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3540 states. [2024-10-12 19:54:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3540 to 2457. [2024-10-12 19:54:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 2128 states have (on average 1.5338345864661653) internal successors, (3264), 2145 states have internal predecessors, (3264), 210 states have call successors, (210), 102 states have call predecessors, (210), 118 states have return successors, (307), 225 states have call predecessors, (307), 210 states have call successors, (307) [2024-10-12 19:54:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3781 transitions. [2024-10-12 19:54:48,162 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3781 transitions. Word has length 80 [2024-10-12 19:54:48,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:48,163 INFO L471 AbstractCegarLoop]: Abstraction has 2457 states and 3781 transitions. [2024-10-12 19:54:48,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3781 transitions. [2024-10-12 19:54:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:54:48,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:48,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:48,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:54:48,167 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:48,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:48,168 INFO L85 PathProgramCache]: Analyzing trace with hash 67697623, now seen corresponding path program 1 times [2024-10-12 19:54:48,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:48,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695106717] [2024-10-12 19:54:48,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:48,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:54:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:48,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:54:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:48,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:54:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:48,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:54:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:48,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:48,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695106717] [2024-10-12 19:54:48,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695106717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:48,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:48,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:54:48,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629298667] [2024-10-12 19:54:48,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:48,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:54:48,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:48,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:54:48,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:48,314 INFO L87 Difference]: Start difference. First operand 2457 states and 3781 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:49,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:49,913 INFO L93 Difference]: Finished difference Result 8749 states and 13616 transitions. [2024-10-12 19:54:49,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:54:49,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2024-10-12 19:54:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:49,953 INFO L225 Difference]: With dead ends: 8749 [2024-10-12 19:54:49,954 INFO L226 Difference]: Without dead ends: 6302 [2024-10-12 19:54:49,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:54:49,966 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 633 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:49,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 907 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:54:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6302 states. [2024-10-12 19:54:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6302 to 4752. [2024-10-12 19:54:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4752 states, 4135 states have (on average 1.5337363966142685) internal successors, (6342), 4168 states have internal predecessors, (6342), 386 states have call successors, (386), 198 states have call predecessors, (386), 230 states have return successors, (661), 417 states have call predecessors, (661), 386 states have call successors, (661) [2024-10-12 19:54:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 7389 transitions. [2024-10-12 19:54:50,414 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 7389 transitions. Word has length 80 [2024-10-12 19:54:50,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:50,415 INFO L471 AbstractCegarLoop]: Abstraction has 4752 states and 7389 transitions. [2024-10-12 19:54:50,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 7389 transitions. [2024-10-12 19:54:50,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:54:50,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:50,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:50,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:54:50,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:50,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:50,422 INFO L85 PathProgramCache]: Analyzing trace with hash 269521557, now seen corresponding path program 1 times [2024-10-12 19:54:50,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:50,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263721144] [2024-10-12 19:54:50,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:50,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:50,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:54:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:50,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:54:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:54:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:54:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:50,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:50,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263721144] [2024-10-12 19:54:50,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263721144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:50,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:50,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:54:50,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794220519] [2024-10-12 19:54:50,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:50,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:54:50,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:50,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:54:50,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:50,580 INFO L87 Difference]: Start difference. First operand 4752 states and 7389 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:52,589 INFO L93 Difference]: Finished difference Result 16604 states and 26062 transitions. [2024-10-12 19:54:52,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:54:52,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2024-10-12 19:54:52,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:52,664 INFO L225 Difference]: With dead ends: 16604 [2024-10-12 19:54:52,665 INFO L226 Difference]: Without dead ends: 11862 [2024-10-12 19:54:52,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:54:52,684 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 582 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:52,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 907 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:54:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11862 states. [2024-10-12 19:54:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11862 to 9339. [2024-10-12 19:54:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9339 states, 8162 states have (on average 1.5344278363146289) internal successors, (12524), 8227 states have internal predecessors, (12524), 722 states have call successors, (722), 390 states have call predecessors, (722), 454 states have return successors, (1515), 785 states have call predecessors, (1515), 722 states have call successors, (1515) [2024-10-12 19:54:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9339 states to 9339 states and 14761 transitions. [2024-10-12 19:54:53,569 INFO L78 Accepts]: Start accepts. Automaton has 9339 states and 14761 transitions. Word has length 80 [2024-10-12 19:54:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:53,570 INFO L471 AbstractCegarLoop]: Abstraction has 9339 states and 14761 transitions. [2024-10-12 19:54:53,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 9339 states and 14761 transitions. [2024-10-12 19:54:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:54:53,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:53,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:53,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:54:53,583 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:53,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:53,584 INFO L85 PathProgramCache]: Analyzing trace with hash 830221335, now seen corresponding path program 1 times [2024-10-12 19:54:53,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:53,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112010628] [2024-10-12 19:54:53,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:53,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:53,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:53,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:54:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:53,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:54:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:53,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:54:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:54:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:53,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:53,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112010628] [2024-10-12 19:54:53,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112010628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:53,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:53,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:54:53,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275388227] [2024-10-12 19:54:53,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:53,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:54:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:53,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:54:53,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:54:53,734 INFO L87 Difference]: Start difference. First operand 9339 states and 14761 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:55,683 INFO L93 Difference]: Finished difference Result 26478 states and 41848 transitions. [2024-10-12 19:54:55,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:54:55,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2024-10-12 19:54:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:55,764 INFO L225 Difference]: With dead ends: 26478 [2024-10-12 19:54:55,764 INFO L226 Difference]: Without dead ends: 17150 [2024-10-12 19:54:55,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:54:55,804 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 782 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:55,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 694 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:54:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17150 states. [2024-10-12 19:54:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17150 to 13994. [2024-10-12 19:54:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13994 states, 12205 states have (on average 1.5231462515362557) internal successors, (18590), 12335 states have internal predecessors, (18590), 1104 states have call successors, (1104), 588 states have call predecessors, (1104), 684 states have return successors, (2141), 1134 states have call predecessors, (2141), 1104 states have call successors, (2141) [2024-10-12 19:54:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13994 states to 13994 states and 21835 transitions. [2024-10-12 19:54:57,431 INFO L78 Accepts]: Start accepts. Automaton has 13994 states and 21835 transitions. Word has length 80 [2024-10-12 19:54:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:57,434 INFO L471 AbstractCegarLoop]: Abstraction has 13994 states and 21835 transitions. [2024-10-12 19:54:57,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:54:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 13994 states and 21835 transitions. [2024-10-12 19:54:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 19:54:57,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:57,475 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:57,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:54:57,475 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:57,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash 119505889, now seen corresponding path program 1 times [2024-10-12 19:54:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:57,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752467910] [2024-10-12 19:54:57,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:57,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:57,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:57,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:54:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:57,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:54:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:57,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:54:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:57,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:54:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:57,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:54:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:57,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 19:54:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:57,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:54:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 19:54:57,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:57,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752467910] [2024-10-12 19:54:57,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752467910] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:54:57,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237186467] [2024-10-12 19:54:57,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:57,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:57,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:57,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:54:57,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:54:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:57,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:54:57,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:54:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 19:54:57,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:54:57,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237186467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:57,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:54:57,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 19:54:57,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142830219] [2024-10-12 19:54:57,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:57,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:54:57,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:57,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:54:57,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:57,896 INFO L87 Difference]: Start difference. First operand 13994 states and 21835 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:54:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:59,851 INFO L93 Difference]: Finished difference Result 41663 states and 65423 transitions. [2024-10-12 19:54:59,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:54:59,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 130 [2024-10-12 19:54:59,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:59,977 INFO L225 Difference]: With dead ends: 41663 [2024-10-12 19:54:59,977 INFO L226 Difference]: Without dead ends: 27680 [2024-10-12 19:55:00,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:00,028 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 204 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:00,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 432 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:55:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27680 states. [2024-10-12 19:55:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27680 to 27580. [2024-10-12 19:55:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27580 states, 24057 states have (on average 1.5184353826329136) internal successors, (36529), 24316 states have internal predecessors, (36529), 2154 states have call successors, (2154), 1176 states have call predecessors, (2154), 1368 states have return successors, (4165), 2151 states have call predecessors, (4165), 2154 states have call successors, (4165) [2024-10-12 19:55:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27580 states to 27580 states and 42848 transitions. [2024-10-12 19:55:02,421 INFO L78 Accepts]: Start accepts. Automaton has 27580 states and 42848 transitions. Word has length 130 [2024-10-12 19:55:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:02,422 INFO L471 AbstractCegarLoop]: Abstraction has 27580 states and 42848 transitions. [2024-10-12 19:55:02,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:55:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 27580 states and 42848 transitions. [2024-10-12 19:55:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 19:55:02,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:02,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:02,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:55:02,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-12 19:55:02,692 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:02,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:02,693 INFO L85 PathProgramCache]: Analyzing trace with hash -564427071, now seen corresponding path program 1 times [2024-10-12 19:55:02,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:02,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367878590] [2024-10-12 19:55:02,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:02,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:02,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:55:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:02,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:55:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:02,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:55:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:02,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:55:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:02,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:55:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:02,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 19:55:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:02,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:55:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 19:55:02,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:02,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367878590] [2024-10-12 19:55:02,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367878590] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:55:02,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487076190] [2024-10-12 19:55:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:02,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:55:02,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:55:02,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:55:02,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 19:55:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:02,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:55:02,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:55:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 19:55:03,028 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:55:03,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487076190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:03,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:55:03,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 19:55:03,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410318663] [2024-10-12 19:55:03,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:03,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:55:03,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:03,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:55:03,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:03,030 INFO L87 Difference]: Start difference. First operand 27580 states and 42848 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:55:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:06,539 INFO L93 Difference]: Finished difference Result 82125 states and 128430 transitions. [2024-10-12 19:55:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:55:06,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 130 [2024-10-12 19:55:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:06,815 INFO L225 Difference]: With dead ends: 82125 [2024-10-12 19:55:06,816 INFO L226 Difference]: Without dead ends: 54556 [2024-10-12 19:55:06,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:06,901 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 199 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:06,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 432 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:55:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54556 states. [2024-10-12 19:55:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54556 to 54358. [2024-10-12 19:55:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54358 states, 47417 states have (on average 1.5135710821013562) internal successors, (71769), 47934 states have internal predecessors, (71769), 4204 states have call successors, (4204), 2352 states have call predecessors, (4204), 2736 states have return successors, (8163), 4135 states have call predecessors, (8163), 4204 states have call successors, (8163) [2024-10-12 19:55:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54358 states to 54358 states and 84136 transitions. [2024-10-12 19:55:11,159 INFO L78 Accepts]: Start accepts. Automaton has 54358 states and 84136 transitions. Word has length 130 [2024-10-12 19:55:11,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:11,160 INFO L471 AbstractCegarLoop]: Abstraction has 54358 states and 84136 transitions. [2024-10-12 19:55:11,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:55:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 54358 states and 84136 transitions. [2024-10-12 19:55:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 19:55:11,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:11,310 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:11,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 19:55:11,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-12 19:55:11,515 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:11,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash 715208673, now seen corresponding path program 1 times [2024-10-12 19:55:11,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172228793] [2024-10-12 19:55:11,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:11,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:55:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:11,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:55:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:11,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:55:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:11,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:55:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:11,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:55:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:11,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 19:55:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:11,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:55:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 19:55:11,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:11,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172228793] [2024-10-12 19:55:11,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172228793] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:55:11,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055276114] [2024-10-12 19:55:11,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:11,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:55:11,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:55:11,676 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:55:11,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 19:55:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:11,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:55:11,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:55:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-12 19:55:11,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:55:11,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055276114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:11,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:55:11,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-12 19:55:11,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006192678] [2024-10-12 19:55:11,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:11,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:55:11,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:11,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:55:11,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:11,824 INFO L87 Difference]: Start difference. First operand 54358 states and 84136 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:55:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:17,615 INFO L93 Difference]: Finished difference Result 161084 states and 252187 transitions. [2024-10-12 19:55:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:55:17,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 130 [2024-10-12 19:55:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:18,649 INFO L225 Difference]: With dead ends: 161084 [2024-10-12 19:55:18,649 INFO L226 Difference]: Without dead ends: 106738 [2024-10-12 19:55:18,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:18,842 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 218 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:18,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 665 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:55:18,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106738 states. [2024-10-12 19:55:26,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106738 to 106738. [2024-10-12 19:55:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106738 states, 93122 states have (on average 1.5075384978844957) internal successors, (140385), 94024 states have internal predecessors, (140385), 8143 states have call successors, (8143), 4704 states have call predecessors, (8143), 5472 states have return successors, (17646), 8137 states have call predecessors, (17646), 8143 states have call successors, (17646) [2024-10-12 19:55:26,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106738 states to 106738 states and 166174 transitions. [2024-10-12 19:55:26,827 INFO L78 Accepts]: Start accepts. Automaton has 106738 states and 166174 transitions. Word has length 130 [2024-10-12 19:55:26,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:26,828 INFO L471 AbstractCegarLoop]: Abstraction has 106738 states and 166174 transitions. [2024-10-12 19:55:26,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:55:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 106738 states and 166174 transitions. [2024-10-12 19:55:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-12 19:55:27,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:27,135 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:55:27,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 19:55:27,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:55:27,336 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:27,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:27,336 INFO L85 PathProgramCache]: Analyzing trace with hash -427065206, now seen corresponding path program 1 times [2024-10-12 19:55:27,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:27,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108781216] [2024-10-12 19:55:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:27,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:27,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:27,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-12 19:55:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:27,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 19:55:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:55:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:27,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:55:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:27,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:55:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:27,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 19:55:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 19:55:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:27,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 19:55:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:27,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-12 19:55:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-12 19:55:27,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108781216] [2024-10-12 19:55:27,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108781216] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:55:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052540492] [2024-10-12 19:55:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:27,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:55:27,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:55:27,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:55:27,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 19:55:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:27,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:55:27,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:55:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-12 19:55:27,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:55:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052540492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:27,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:55:27,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 19:55:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145351572] [2024-10-12 19:55:27,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:27,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:55:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:27,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:55:27,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:27,806 INFO L87 Difference]: Start difference. First operand 106738 states and 166174 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)