./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-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 05d3b7d21cc48825b4a0189c75f03d768acc6241312029d3e223c1b9b2a509ea --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:13:18,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:13:18,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:13:18,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:13:18,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:13:18,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:13:18,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:13:18,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:13:18,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:13:18,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:13:18,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:13:18,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:13:18,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:13:18,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:13:18,687 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:13:18,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:13:18,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:13:18,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:13:18,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:13:18,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:13:18,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:13:18,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:13:18,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:13:18,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:13:18,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:13:18,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:13:18,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:13:18,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:13:18,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:13:18,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:13:18,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:13:18,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:13:18,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:13:18,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:13:18,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:13:18,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:13:18,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:13:18,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:13:18,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:13:18,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:13:18,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:13:18,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:13:18,694 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-clean/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-clean/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 -> 05d3b7d21cc48825b4a0189c75f03d768acc6241312029d3e223c1b9b2a509ea [2024-10-11 03:13:18,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:13:18,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:13:18,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:13:18,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:13:18,926 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:13:18,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-2.c [2024-10-11 03:13:20,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:13:20,728 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:13:20,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-2.c [2024-10-11 03:13:20,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fdd56150e/dce21b70b1b143b08c99c3df96eb23bb/FLAGd363764be [2024-10-11 03:13:20,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fdd56150e/dce21b70b1b143b08c99c3df96eb23bb [2024-10-11 03:13:20,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:13:20,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:13:20,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:13:20,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:13:20,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:13:20,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:13:20" (1/1) ... [2024-10-11 03:13:20,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36aab8a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:20, skipping insertion in model container [2024-10-11 03:13:20,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:13:20" (1/1) ... [2024-10-11 03:13:20,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:13:20,929 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-2.c[671,684] [2024-10-11 03:13:21,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:13:21,014 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:13:21,025 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-2.c[671,684] [2024-10-11 03:13:21,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:13:21,080 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:13:21,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21 WrapperNode [2024-10-11 03:13:21,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:13:21,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:13:21,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:13:21,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:13:21,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21" (1/1) ... [2024-10-11 03:13:21,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21" (1/1) ... [2024-10-11 03:13:21,134 INFO L138 Inliner]: procedures = 36, calls = 44, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 405 [2024-10-11 03:13:21,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:13:21,135 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:13:21,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:13:21,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:13:21,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21" (1/1) ... [2024-10-11 03:13:21,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21" (1/1) ... [2024-10-11 03:13:21,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21" (1/1) ... [2024-10-11 03:13:21,164 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-11 03:13:21,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21" (1/1) ... [2024-10-11 03:13:21,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21" (1/1) ... [2024-10-11 03:13:21,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21" (1/1) ... [2024-10-11 03:13:21,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21" (1/1) ... [2024-10-11 03:13:21,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21" (1/1) ... [2024-10-11 03:13:21,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21" (1/1) ... [2024-10-11 03:13:21,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:13:21,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:13:21,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:13:21,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:13:21,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21" (1/1) ... [2024-10-11 03:13:21,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:13:21,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:13:21,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:13:21,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:13:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:13:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 03:13:21,266 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 03:13:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 03:13:21,266 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 03:13:21,266 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 03:13:21,267 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 03:13:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 03:13:21,267 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 03:13:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 03:13:21,267 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 03:13:21,267 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 03:13:21,268 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 03:13:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:13:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 03:13:21,268 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 03:13:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:13:21,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:13:21,337 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:13:21,338 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:13:21,763 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-11 03:13:21,763 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:13:21,808 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:13:21,808 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-11 03:13:21,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:13:21 BoogieIcfgContainer [2024-10-11 03:13:21,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:13:21,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:13:21,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:13:21,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:13:21,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:13:20" (1/3) ... [2024-10-11 03:13:21,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f5e2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:13:21, skipping insertion in model container [2024-10-11 03:13:21,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:13:21" (2/3) ... [2024-10-11 03:13:21,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f5e2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:13:21, skipping insertion in model container [2024-10-11 03:13:21,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:13:21" (3/3) ... [2024-10-11 03:13:21,818 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.04.cil-2.c [2024-10-11 03:13:21,835 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:13:21,835 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:13:21,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:13:21,906 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;@7d55e447, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:13:21,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:13:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 143 states have (on average 1.6993006993006994) internal successors, (243), 147 states have internal predecessors, (243), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 03:13:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:13:21,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:21,924 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, 1] [2024-10-11 03:13:21,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:21,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:21,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1753003295, now seen corresponding path program 1 times [2024-10-11 03:13:21,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:21,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116848764] [2024-10-11 03:13:21,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:21,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:22,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:22,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:22,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:22,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:22,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:22,359 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-11 03:13:22,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:22,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116848764] [2024-10-11 03:13:22,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116848764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:22,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:22,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:13:22,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162542584] [2024-10-11 03:13:22,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:22,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:13:22,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:22,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:13:22,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:13:22,438 INFO L87 Difference]: Start difference. First operand has 172 states, 143 states have (on average 1.6993006993006994) internal successors, (243), 147 states have internal predecessors, (243), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) 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, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:23,130 INFO L93 Difference]: Finished difference Result 385 states and 641 transitions. [2024-10-11 03:13:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:13:23,135 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, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 03:13:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:23,147 INFO L225 Difference]: With dead ends: 385 [2024-10-11 03:13:23,147 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 03:13:23,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:13:23,156 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 421 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:23,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 326 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:13:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 03:13:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 169. [2024-10-11 03:13:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 142 states have (on average 1.5845070422535212) internal successors, (225), 144 states have internal predecessors, (225), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 03:13:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 263 transitions. [2024-10-11 03:13:23,219 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 263 transitions. Word has length 81 [2024-10-11 03:13:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:23,219 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 263 transitions. [2024-10-11 03:13:23,220 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, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 263 transitions. [2024-10-11 03:13:23,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:13:23,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:23,224 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, 1] [2024-10-11 03:13:23,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:13:23,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:23,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:23,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1676102497, now seen corresponding path program 1 times [2024-10-11 03:13:23,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:23,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875945933] [2024-10-11 03:13:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:23,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:23,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:23,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:23,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:23,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:23,472 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-11 03:13:23,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:23,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875945933] [2024-10-11 03:13:23,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875945933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:23,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:23,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:13:23,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906051164] [2024-10-11 03:13:23,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:23,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:13:23,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:23,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:13:23,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:13:23,482 INFO L87 Difference]: Start difference. First operand 169 states and 263 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:24,669 INFO L93 Difference]: Finished difference Result 590 states and 941 transitions. [2024-10-11 03:13:24,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:13:24,670 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 03:13:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:24,675 INFO L225 Difference]: With dead ends: 590 [2024-10-11 03:13:24,675 INFO L226 Difference]: Without dead ends: 431 [2024-10-11 03:13:24,677 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-11 03:13:24,678 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 621 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:24,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 540 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:13:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-10-11 03:13:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 330. [2024-10-11 03:13:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 283 states have (on average 1.5936395759717314) internal successors, (451), 286 states have internal predecessors, (451), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-10-11 03:13:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 518 transitions. [2024-10-11 03:13:24,730 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 518 transitions. Word has length 81 [2024-10-11 03:13:24,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:24,730 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 518 transitions. [2024-10-11 03:13:24,731 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 518 transitions. [2024-10-11 03:13:24,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:13:24,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:24,734 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, 1] [2024-10-11 03:13:24,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:13:24,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:24,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:24,735 INFO L85 PathProgramCache]: Analyzing trace with hash 674003233, now seen corresponding path program 1 times [2024-10-11 03:13:24,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:24,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114308735] [2024-10-11 03:13:24,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:24,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:24,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:24,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:24,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:24,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:24,949 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-11 03:13:24,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:24,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114308735] [2024-10-11 03:13:24,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114308735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:24,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:24,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:24,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585348493] [2024-10-11 03:13:24,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:24,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:24,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:24,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:24,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:24,951 INFO L87 Difference]: Start difference. First operand 330 states and 518 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:26,317 INFO L93 Difference]: Finished difference Result 965 states and 1535 transitions. [2024-10-11 03:13:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:13:26,317 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 03:13:26,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:26,320 INFO L225 Difference]: With dead ends: 965 [2024-10-11 03:13:26,320 INFO L226 Difference]: Without dead ends: 645 [2024-10-11 03:13:26,322 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-11 03:13:26,322 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 624 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:26,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1021 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:13:26,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-11 03:13:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 480. [2024-10-11 03:13:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 413 states have (on average 1.585956416464891) internal successors, (655), 417 states have internal predecessors, (655), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-10-11 03:13:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 750 transitions. [2024-10-11 03:13:26,352 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 750 transitions. Word has length 81 [2024-10-11 03:13:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:26,352 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 750 transitions. [2024-10-11 03:13:26,370 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 750 transitions. [2024-10-11 03:13:26,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:13:26,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:26,372 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, 1] [2024-10-11 03:13:26,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:13:26,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:26,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:26,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1627943391, now seen corresponding path program 1 times [2024-10-11 03:13:26,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:26,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985602819] [2024-10-11 03:13:26,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:26,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:26,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:26,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:26,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:26,541 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-11 03:13:26,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:26,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985602819] [2024-10-11 03:13:26,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985602819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:26,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:26,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:26,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363431180] [2024-10-11 03:13:26,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:26,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:26,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:26,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:26,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:26,546 INFO L87 Difference]: Start difference. First operand 480 states and 750 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:27,580 INFO L93 Difference]: Finished difference Result 1514 states and 2403 transitions. [2024-10-11 03:13:27,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:13:27,581 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 03:13:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:27,585 INFO L225 Difference]: With dead ends: 1514 [2024-10-11 03:13:27,585 INFO L226 Difference]: Without dead ends: 1044 [2024-10-11 03:13:27,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:13:27,587 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 672 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:27,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 670 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:13:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2024-10-11 03:13:27,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 781. [2024-10-11 03:13:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 674 states have (on average 1.5786350148367954) internal successors, (1064), 680 states have internal predecessors, (1064), 72 states have call successors, (72), 31 states have call predecessors, (72), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-11 03:13:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1219 transitions. [2024-10-11 03:13:27,625 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1219 transitions. Word has length 81 [2024-10-11 03:13:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:27,626 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1219 transitions. [2024-10-11 03:13:27,626 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1219 transitions. [2024-10-11 03:13:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:13:27,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:27,627 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, 1] [2024-10-11 03:13:27,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:13:27,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:27,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:27,628 INFO L85 PathProgramCache]: Analyzing trace with hash 411789665, now seen corresponding path program 1 times [2024-10-11 03:13:27,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:27,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142108013] [2024-10-11 03:13:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:27,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:27,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:27,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:27,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:27,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:27,726 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-11 03:13:27,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:27,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142108013] [2024-10-11 03:13:27,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142108013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:27,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:27,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:27,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329070980] [2024-10-11 03:13:27,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:27,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:27,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:27,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:27,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:27,729 INFO L87 Difference]: Start difference. First operand 781 states and 1219 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:28,374 INFO L93 Difference]: Finished difference Result 1803 states and 2863 transitions. [2024-10-11 03:13:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:13:28,374 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 03:13:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:28,379 INFO L225 Difference]: With dead ends: 1803 [2024-10-11 03:13:28,379 INFO L226 Difference]: Without dead ends: 1032 [2024-10-11 03:13:28,380 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-11 03:13:28,381 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 533 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:28,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 423 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:13:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2024-10-11 03:13:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 781. [2024-10-11 03:13:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 674 states have (on average 1.5712166172106825) internal successors, (1059), 680 states have internal predecessors, (1059), 72 states have call successors, (72), 31 states have call predecessors, (72), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-11 03:13:28,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1214 transitions. [2024-10-11 03:13:28,428 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1214 transitions. Word has length 81 [2024-10-11 03:13:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:28,429 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1214 transitions. [2024-10-11 03:13:28,429 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1214 transitions. [2024-10-11 03:13:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:13:28,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:28,430 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, 1] [2024-10-11 03:13:28,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:13:28,431 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:28,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:28,431 INFO L85 PathProgramCache]: Analyzing trace with hash -320177761, now seen corresponding path program 1 times [2024-10-11 03:13:28,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:28,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950201923] [2024-10-11 03:13:28,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:28,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:28,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:28,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:28,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:28,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:28,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:28,570 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-11 03:13:28,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:28,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950201923] [2024-10-11 03:13:28,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950201923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:28,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:28,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:28,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292408412] [2024-10-11 03:13:28,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:28,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:28,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:28,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:28,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:28,574 INFO L87 Difference]: Start difference. First operand 781 states and 1214 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:29,175 INFO L93 Difference]: Finished difference Result 1797 states and 2837 transitions. [2024-10-11 03:13:29,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:13:29,175 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 03:13:29,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:29,179 INFO L225 Difference]: With dead ends: 1797 [2024-10-11 03:13:29,179 INFO L226 Difference]: Without dead ends: 1026 [2024-10-11 03:13:29,181 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-11 03:13:29,182 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 531 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:29,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 423 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:13:29,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-10-11 03:13:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 781. [2024-10-11 03:13:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 674 states have (on average 1.5637982195845697) internal successors, (1054), 680 states have internal predecessors, (1054), 72 states have call successors, (72), 31 states have call predecessors, (72), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-11 03:13:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1209 transitions. [2024-10-11 03:13:29,222 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1209 transitions. Word has length 81 [2024-10-11 03:13:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:29,223 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1209 transitions. [2024-10-11 03:13:29,223 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1209 transitions. [2024-10-11 03:13:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:13:29,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:29,224 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, 1] [2024-10-11 03:13:29,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:13:29,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:29,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:29,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2006357599, now seen corresponding path program 1 times [2024-10-11 03:13:29,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:29,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501424384] [2024-10-11 03:13:29,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:29,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:29,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:29,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:29,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:29,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:29,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:29,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:29,415 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-11 03:13:29,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:29,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501424384] [2024-10-11 03:13:29,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501424384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:29,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:29,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:29,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839633654] [2024-10-11 03:13:29,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:29,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:29,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:29,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:29,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:29,418 INFO L87 Difference]: Start difference. First operand 781 states and 1209 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:30,649 INFO L93 Difference]: Finished difference Result 2780 states and 4348 transitions. [2024-10-11 03:13:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:13:30,650 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 03:13:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:30,658 INFO L225 Difference]: With dead ends: 2780 [2024-10-11 03:13:30,659 INFO L226 Difference]: Without dead ends: 2009 [2024-10-11 03:13:30,661 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-11 03:13:30,662 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 754 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:30,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1012 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:13:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2024-10-11 03:13:30,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1384. [2024-10-11 03:13:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1201 states have (on average 1.5570358034970857) internal successors, (1870), 1211 states have internal predecessors, (1870), 120 states have call successors, (120), 55 states have call predecessors, (120), 62 states have return successors, (153), 125 states have call predecessors, (153), 118 states have call successors, (153) [2024-10-11 03:13:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2143 transitions. [2024-10-11 03:13:30,736 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2143 transitions. Word has length 81 [2024-10-11 03:13:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:30,736 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2143 transitions. [2024-10-11 03:13:30,737 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2143 transitions. [2024-10-11 03:13:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:13:30,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:30,738 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, 1] [2024-10-11 03:13:30,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:13:30,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:30,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:30,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2060750497, now seen corresponding path program 1 times [2024-10-11 03:13:30,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:30,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038137256] [2024-10-11 03:13:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:30,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:30,864 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-11 03:13:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038137256] [2024-10-11 03:13:30,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038137256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:30,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:30,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:30,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70052708] [2024-10-11 03:13:30,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:30,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:30,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:30,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:30,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:30,867 INFO L87 Difference]: Start difference. First operand 1384 states and 2143 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:32,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:32,382 INFO L93 Difference]: Finished difference Result 5003 states and 7824 transitions. [2024-10-11 03:13:32,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:13:32,382 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 03:13:32,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:32,396 INFO L225 Difference]: With dead ends: 5003 [2024-10-11 03:13:32,396 INFO L226 Difference]: Without dead ends: 3629 [2024-10-11 03:13:32,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:13:32,402 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 630 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:32,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1008 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:13:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2024-10-11 03:13:32,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 2504. [2024-10-11 03:13:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2173 states have (on average 1.54348826507133) internal successors, (3354), 2191 states have internal predecessors, (3354), 212 states have call successors, (212), 103 states have call predecessors, (212), 118 states have return successors, (307), 225 states have call predecessors, (307), 210 states have call successors, (307) [2024-10-11 03:13:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3873 transitions. [2024-10-11 03:13:32,585 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3873 transitions. Word has length 81 [2024-10-11 03:13:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:32,585 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 3873 transitions. [2024-10-11 03:13:32,585 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3873 transitions. [2024-10-11 03:13:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:13:32,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:32,588 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, 1] [2024-10-11 03:13:32,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:13:32,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:32,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:32,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1816820193, now seen corresponding path program 1 times [2024-10-11 03:13:32,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:32,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927896994] [2024-10-11 03:13:32,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:32,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:32,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:32,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:32,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:32,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:32,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:32,708 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-11 03:13:32,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:32,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927896994] [2024-10-11 03:13:32,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927896994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:32,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:32,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191938433] [2024-10-11 03:13:32,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:32,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:32,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:32,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:32,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:32,711 INFO L87 Difference]: Start difference. First operand 2504 states and 3873 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:34,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:34,531 INFO L93 Difference]: Finished difference Result 8885 states and 13882 transitions. [2024-10-11 03:13:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:13:34,532 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 03:13:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:34,556 INFO L225 Difference]: With dead ends: 8885 [2024-10-11 03:13:34,556 INFO L226 Difference]: Without dead ends: 6391 [2024-10-11 03:13:34,562 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-11 03:13:34,565 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 647 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:34,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1012 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:13:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6391 states. [2024-10-11 03:13:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6391 to 4839. [2024-10-11 03:13:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4839 states, 4220 states have (on average 1.543127962085308) internal successors, (6512), 4254 states have internal predecessors, (6512), 388 states have call successors, (388), 199 states have call predecessors, (388), 230 states have return successors, (661), 417 states have call predecessors, (661), 386 states have call successors, (661) [2024-10-11 03:13:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 7561 transitions. [2024-10-11 03:13:34,896 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 7561 transitions. Word has length 81 [2024-10-11 03:13:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:34,896 INFO L471 AbstractCegarLoop]: Abstraction has 4839 states and 7561 transitions. [2024-10-11 03:13:34,897 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 7561 transitions. [2024-10-11 03:13:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:13:34,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:34,900 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, 1] [2024-10-11 03:13:34,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:13:34,901 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:34,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:34,901 INFO L85 PathProgramCache]: Analyzing trace with hash -516572445, now seen corresponding path program 1 times [2024-10-11 03:13:34,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:34,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632320152] [2024-10-11 03:13:34,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:34,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:34,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:34,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:34,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:35,006 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-11 03:13:35,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:35,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632320152] [2024-10-11 03:13:35,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632320152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:35,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:35,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:13:35,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810095068] [2024-10-11 03:13:35,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:35,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:13:35,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:35,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:13:35,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:35,008 INFO L87 Difference]: Start difference. First operand 4839 states and 7561 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:37,040 INFO L93 Difference]: Finished difference Result 16860 states and 26568 transitions. [2024-10-11 03:13:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:13:37,041 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 03:13:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:37,120 INFO L225 Difference]: With dead ends: 16860 [2024-10-11 03:13:37,120 INFO L226 Difference]: Without dead ends: 12031 [2024-10-11 03:13:37,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:13:37,146 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 596 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:37,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1012 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:13:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12031 states. [2024-10-11 03:13:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12031 to 9506. [2024-10-11 03:13:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9506 states, 8327 states have (on average 1.5436531764140746) internal successors, (12854), 8393 states have internal predecessors, (12854), 724 states have call successors, (724), 391 states have call predecessors, (724), 454 states have return successors, (1515), 785 states have call predecessors, (1515), 722 states have call successors, (1515) [2024-10-11 03:13:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9506 states to 9506 states and 15093 transitions. [2024-10-11 03:13:37,988 INFO L78 Accepts]: Start accepts. Automaton has 9506 states and 15093 transitions. Word has length 81 [2024-10-11 03:13:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:37,989 INFO L471 AbstractCegarLoop]: Abstraction has 9506 states and 15093 transitions. [2024-10-11 03:13:37,989 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 9506 states and 15093 transitions. [2024-10-11 03:13:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 03:13:37,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:37,997 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, 1] [2024-10-11 03:13:37,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:13:37,998 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:37,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:37,999 INFO L85 PathProgramCache]: Analyzing trace with hash -314748511, now seen corresponding path program 1 times [2024-10-11 03:13:37,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:37,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978857637] [2024-10-11 03:13:37,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:38,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:38,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:38,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:38,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:38,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:38,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:38,088 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-11 03:13:38,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:38,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978857637] [2024-10-11 03:13:38,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978857637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:38,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:13:38,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:13:38,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770054902] [2024-10-11 03:13:38,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:38,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:13:38,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:38,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:13:38,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:13:38,089 INFO L87 Difference]: Start difference. First operand 9506 states and 15093 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:40,819 INFO L93 Difference]: Finished difference Result 26812 states and 42512 transitions. [2024-10-11 03:13:40,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:13:40,819 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-11 03:13:40,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:40,896 INFO L225 Difference]: With dead ends: 26812 [2024-10-11 03:13:40,896 INFO L226 Difference]: Without dead ends: 17317 [2024-10-11 03:13:40,931 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-11 03:13:40,932 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 796 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:13:40,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 732 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:13:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17317 states. [2024-10-11 03:13:42,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17317 to 14161. [2024-10-11 03:13:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14161 states, 12370 states have (on average 1.5295068714632174) internal successors, (18920), 12501 states have internal predecessors, (18920), 1106 states have call successors, (1106), 589 states have call predecessors, (1106), 684 states have return successors, (2141), 1134 states have call predecessors, (2141), 1104 states have call successors, (2141) [2024-10-11 03:13:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14161 states to 14161 states and 22167 transitions. [2024-10-11 03:13:42,128 INFO L78 Accepts]: Start accepts. Automaton has 14161 states and 22167 transitions. Word has length 81 [2024-10-11 03:13:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:42,129 INFO L471 AbstractCegarLoop]: Abstraction has 14161 states and 22167 transitions. [2024-10-11 03:13:42,130 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 03:13:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 14161 states and 22167 transitions. [2024-10-11 03:13:42,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:13:42,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:42,163 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, 1] [2024-10-11 03:13:42,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:13:42,164 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:42,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:42,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1718177814, now seen corresponding path program 1 times [2024-10-11 03:13:42,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:42,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091583842] [2024-10-11 03:13:42,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:42,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:42,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:42,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:42,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:42,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:42,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:42,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:13:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:42,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:42,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:13:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:42,313 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-11 03:13:42,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:42,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091583842] [2024-10-11 03:13:42,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091583842] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:13:42,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498584485] [2024-10-11 03:13:42,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:42,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:42,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:13:42,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:13:42,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:13:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:42,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:13:42,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:13:42,518 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-11 03:13:42,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:13:42,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498584485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:42,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:13:42,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 03:13:42,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870460211] [2024-10-11 03:13:42,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:42,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:13:42,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:42,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:13:42,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:42,521 INFO L87 Difference]: Start difference. First operand 14161 states and 22167 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:13:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:44,856 INFO L93 Difference]: Finished difference Result 42164 states and 66419 transitions. [2024-10-11 03:13:44,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:13:44,857 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2024-10-11 03:13:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:45,012 INFO L225 Difference]: With dead ends: 42164 [2024-10-11 03:13:45,012 INFO L226 Difference]: Without dead ends: 28014 [2024-10-11 03:13:45,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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-11 03:13:45,076 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 216 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 456 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-11 03:13:45,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 456 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:13:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28014 states. [2024-10-11 03:13:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28014 to 27912. [2024-10-11 03:13:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27912 states, 24387 states have (on average 1.5249518185918727) internal successors, (37189), 24647 states have internal predecessors, (37189), 2156 states have call successors, (2156), 1177 states have call predecessors, (2156), 1368 states have return successors, (4165), 2151 states have call predecessors, (4165), 2154 states have call successors, (4165) [2024-10-11 03:13:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27912 states to 27912 states and 43510 transitions. [2024-10-11 03:13:47,472 INFO L78 Accepts]: Start accepts. Automaton has 27912 states and 43510 transitions. Word has length 131 [2024-10-11 03:13:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:47,473 INFO L471 AbstractCegarLoop]: Abstraction has 27912 states and 43510 transitions. [2024-10-11 03:13:47,473 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:13:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 27912 states and 43510 transitions. [2024-10-11 03:13:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:13:47,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:47,532 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, 1] [2024-10-11 03:13:47,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 03:13:47,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 03:13:47,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:47,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1991092534, now seen corresponding path program 1 times [2024-10-11 03:13:47,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:47,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886366029] [2024-10-11 03:13:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:47,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:13:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:13:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:47,939 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-11 03:13:47,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:47,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886366029] [2024-10-11 03:13:47,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886366029] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:13:47,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934101070] [2024-10-11 03:13:47,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:47,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:47,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:13:47,946 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:13:47,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:13:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:48,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:13:48,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:13:48,206 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-11 03:13:48,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:13:48,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934101070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:48,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:13:48,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 03:13:48,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429471385] [2024-10-11 03:13:48,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:48,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:13:48,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:48,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:13:48,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:48,210 INFO L87 Difference]: Start difference. First operand 27912 states and 43510 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:13:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:13:52,411 INFO L93 Difference]: Finished difference Result 83121 states and 130416 transitions. [2024-10-11 03:13:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:13:52,412 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2024-10-11 03:13:52,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:13:52,644 INFO L225 Difference]: With dead ends: 83121 [2024-10-11 03:13:52,644 INFO L226 Difference]: Without dead ends: 55220 [2024-10-11 03:13:52,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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-11 03:13:52,732 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 211 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 456 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-11 03:13:52,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 456 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:13:52,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55220 states. [2024-10-11 03:13:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55220 to 55020. [2024-10-11 03:13:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55020 states, 48077 states have (on average 1.5202487676019718) internal successors, (73089), 48595 states have internal predecessors, (73089), 4206 states have call successors, (4206), 2353 states have call predecessors, (4206), 2736 states have return successors, (8163), 4135 states have call predecessors, (8163), 4204 states have call successors, (8163) [2024-10-11 03:13:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55020 states to 55020 states and 85458 transitions. [2024-10-11 03:13:57,681 INFO L78 Accepts]: Start accepts. Automaton has 55020 states and 85458 transitions. Word has length 131 [2024-10-11 03:13:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:13:57,682 INFO L471 AbstractCegarLoop]: Abstraction has 55020 states and 85458 transitions. [2024-10-11 03:13:57,682 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:13:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 55020 states and 85458 transitions. [2024-10-11 03:13:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:13:57,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:13:57,766 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, 1] [2024-10-11 03:13:57,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:13:57,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:57,968 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:13:57,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:13:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1289872362, now seen corresponding path program 1 times [2024-10-11 03:13:57,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:13:57,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248627231] [2024-10-11 03:13:57,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:57,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:13:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:58,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:13:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:58,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:13:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:58,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:13:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:13:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:58,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:13:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:58,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:13:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:58,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:13:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:58,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 03:13:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:58,106 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-11 03:13:58,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:13:58,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248627231] [2024-10-11 03:13:58,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248627231] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:13:58,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283392182] [2024-10-11 03:13:58,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:13:58,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:13:58,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:13:58,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:13:58,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:13:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:13:58,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:13:58,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:13:58,257 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-11 03:13:58,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:13:58,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283392182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:13:58,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:13:58,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 03:13:58,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571119842] [2024-10-11 03:13:58,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:13:58,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:13:58,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:13:58,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:13:58,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:13:58,262 INFO L87 Difference]: Start difference. First operand 55020 states and 85458 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:14:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:14:06,062 INFO L93 Difference]: Finished difference Result 162408 states and 254831 transitions. [2024-10-11 03:14:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:14:06,062 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 131 [2024-10-11 03:14:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:14:06,712 INFO L225 Difference]: With dead ends: 162408 [2024-10-11 03:14:06,713 INFO L226 Difference]: Without dead ends: 107400 [2024-10-11 03:14:06,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 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-11 03:14:06,851 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 218 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 689 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:14:06,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 689 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:14:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107400 states. [2024-10-11 03:14:15,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107400 to 107400. [2024-10-11 03:14:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107400 states, 93782 states have (on average 1.511004243884754) internal successors, (141705), 94685 states have internal predecessors, (141705), 8145 states have call successors, (8145), 4705 states have call predecessors, (8145), 5472 states have return successors, (17646), 8137 states have call predecessors, (17646), 8143 states have call successors, (17646) [2024-10-11 03:14:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107400 states to 107400 states and 167496 transitions. [2024-10-11 03:14:16,134 INFO L78 Accepts]: Start accepts. Automaton has 107400 states and 167496 transitions. Word has length 131 [2024-10-11 03:14:16,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:14:16,135 INFO L471 AbstractCegarLoop]: Abstraction has 107400 states and 167496 transitions. [2024-10-11 03:14:16,135 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), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 03:14:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 107400 states and 167496 transitions. [2024-10-11 03:14:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 03:14:16,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:14:16,492 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, 1] [2024-10-11 03:14:16,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:14:16,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:14:16,694 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:14:16,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:14:16,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1396618167, now seen corresponding path program 1 times [2024-10-11 03:14:16,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:14:16,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440731784] [2024-10-11 03:14:16,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:16,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:14:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:14:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 03:14:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:14:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 03:14:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:14:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 03:14:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:14:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 03:14:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 03:14:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-11 03:14:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,855 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-11 03:14:16,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:14:16,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440731784] [2024-10-11 03:14:16,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440731784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:14:16,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692317547] [2024-10-11 03:14:16,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:14:16,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:14:16,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:14:16,860 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:14:16,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:14:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:14:16,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 03:14:16,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:14:17,084 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-11 03:14:17,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:14:17,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692317547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:14:17,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:14:17,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 03:14:17,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624833825] [2024-10-11 03:14:17,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:14:17,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:14:17,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:14:17,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:14:17,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:14:17,087 INFO L87 Difference]: Start difference. First operand 107400 states and 167496 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)