./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem12_label14.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'ada1a27904128215b4edfdaf35827c452e538bc81c43cd0aac0f11f9e4d77236'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label14.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ada1a27904128215b4edfdaf35827c452e538bc81c43cd0aac0f11f9e4d77236 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:41:35,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:41:35,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:41:35,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:41:35,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:41:35,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:41:35,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:41:35,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:41:35,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:41:35,600 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:41:35,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:41:35,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:41:35,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:41:35,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:41:35,600 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:41:35,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:41:35,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:41:35,601 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:41:35,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:41:35,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:41:35,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:41:35,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:41:35,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:41:35,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:41:35,602 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:41:35,602 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:41:35,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:41:35,602 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:41:35,602 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:41:35,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:41:35,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:41:35,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:41:35,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:41:35,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:41:35,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:41:35,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:41:35,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:41:35,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:41:35,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:41:35,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:41:35,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:41:35,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:41:35,603 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> ada1a27904128215b4edfdaf35827c452e538bc81c43cd0aac0f11f9e4d77236 [2024-11-06 19:41:35,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:41:35,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:41:35,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:41:35,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:41:35,894 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:41:35,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label14.c [2024-11-06 19:41:37,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:41:37,569 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:41:37,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label14.c [2024-11-06 19:41:37,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5209b8101/7e69e9799b30462ca99c8f0aa6187c1a/FLAGb5bdde6a3 [2024-11-06 19:41:37,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5209b8101/7e69e9799b30462ca99c8f0aa6187c1a [2024-11-06 19:41:37,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:41:37,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:41:37,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:41:37,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:41:37,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:41:37,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:41:37" (1/1) ... [2024-11-06 19:41:37,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b28d554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:37, skipping insertion in model container [2024-11-06 19:41:37,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:41:37" (1/1) ... [2024-11-06 19:41:37,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:41:37,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label14.c[6042,6055] [2024-11-06 19:41:38,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:41:38,480 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:41:38,506 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label14.c[6042,6055] [2024-11-06 19:41:38,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:41:38,862 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:41:38,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38 WrapperNode [2024-11-06 19:41:38,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:41:38,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:41:38,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:41:38,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:41:38,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38" (1/1) ... [2024-11-06 19:41:38,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38" (1/1) ... [2024-11-06 19:41:39,301 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-11-06 19:41:39,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:41:39,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:41:39,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:41:39,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:41:39,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38" (1/1) ... [2024-11-06 19:41:39,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38" (1/1) ... [2024-11-06 19:41:39,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38" (1/1) ... [2024-11-06 19:41:39,567 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 19:41:39,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38" (1/1) ... [2024-11-06 19:41:39,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38" (1/1) ... [2024-11-06 19:41:39,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38" (1/1) ... [2024-11-06 19:41:39,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38" (1/1) ... [2024-11-06 19:41:39,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38" (1/1) ... [2024-11-06 19:41:39,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38" (1/1) ... [2024-11-06 19:41:39,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:41:39,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:41:39,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:41:39,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:41:39,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38" (1/1) ... [2024-11-06 19:41:39,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:41:39,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:41:39,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 19:41:39,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 19:41:39,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:41:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:41:39,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:41:39,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:41:40,038 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:41:40,040 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:41:44,272 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-06 19:41:44,272 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:41:44,340 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:41:44,340 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:41:44,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:41:44 BoogieIcfgContainer [2024-11-06 19:41:44,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:41:44,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:41:44,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:41:44,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:41:44,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:41:37" (1/3) ... [2024-11-06 19:41:44,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720054e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:41:44, skipping insertion in model container [2024-11-06 19:41:44,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:41:38" (2/3) ... [2024-11-06 19:41:44,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720054e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:41:44, skipping insertion in model container [2024-11-06 19:41:44,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:41:44" (3/3) ... [2024-11-06 19:41:44,366 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label14.c [2024-11-06 19:41:44,387 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:41:44,388 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:41:44,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:41:44,485 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;@5758d95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:41:44,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:41:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:41:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 19:41:44,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:44,505 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] [2024-11-06 19:41:44,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:44,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash 563919826, now seen corresponding path program 1 times [2024-11-06 19:41:44,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:44,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713958927] [2024-11-06 19:41:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:41:45,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:45,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713958927] [2024-11-06 19:41:45,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713958927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:45,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:45,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148903184] [2024-11-06 19:41:45,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:45,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:41:45,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:45,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:41:45,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:41:45,117 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:41:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:51,157 INFO L93 Difference]: Finished difference Result 3142 states and 6130 transitions. [2024-11-06 19:41:51,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:41:51,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-06 19:41:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:51,177 INFO L225 Difference]: With dead ends: 3142 [2024-11-06 19:41:51,177 INFO L226 Difference]: Without dead ends: 2257 [2024-11-06 19:41:51,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:41:51,189 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 2213 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5678 mSolverCounterSat, 1220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 6898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1220 IncrementalHoareTripleChecker+Valid, 5678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:51,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 783 Invalid, 6898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1220 Valid, 5678 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-06 19:41:51,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2024-11-06 19:41:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2024-11-06 19:41:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.5802304964539007) internal successors, (3565), 2256 states have internal predecessors, (3565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:41:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3565 transitions. [2024-11-06 19:41:51,325 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3565 transitions. Word has length 48 [2024-11-06 19:41:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:51,326 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3565 transitions. [2024-11-06 19:41:51,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:41:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3565 transitions. [2024-11-06 19:41:51,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-06 19:41:51,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:51,330 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, 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] [2024-11-06 19:41:51,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:41:51,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:51,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1162572255, now seen corresponding path program 1 times [2024-11-06 19:41:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:51,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592258006] [2024-11-06 19:41:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:51,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:51,778 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:41:51,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:51,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592258006] [2024-11-06 19:41:51,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592258006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:51,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:51,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:51,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722772078] [2024-11-06 19:41:51,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:51,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:41:51,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:51,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:41:51,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:41:51,783 INFO L87 Difference]: Start difference. First operand 2257 states and 3565 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:41:55,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:55,436 INFO L93 Difference]: Finished difference Result 5300 states and 9213 transitions. [2024-11-06 19:41:55,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:41:55,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-11-06 19:41:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:55,450 INFO L225 Difference]: With dead ends: 5300 [2024-11-06 19:41:55,451 INFO L226 Difference]: Without dead ends: 3759 [2024-11-06 19:41:55,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:41:55,453 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:55,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 712 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-06 19:41:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2024-11-06 19:41:55,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3759. [2024-11-06 19:41:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.3685470995210218) internal successors, (5143), 3758 states have internal predecessors, (5143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:41:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5143 transitions. [2024-11-06 19:41:55,521 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5143 transitions. Word has length 119 [2024-11-06 19:41:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:55,522 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5143 transitions. [2024-11-06 19:41:55,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:41:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5143 transitions. [2024-11-06 19:41:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-06 19:41:55,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:55,534 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:41:55,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:41:55,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:55,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash 560363496, now seen corresponding path program 1 times [2024-11-06 19:41:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:55,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754284759] [2024-11-06 19:41:55,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:55,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-06 19:41:56,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:56,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754284759] [2024-11-06 19:41:56,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754284759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:41:56,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900454913] [2024-11-06 19:41:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:56,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:41:56,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:41:56,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:41:56,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 19:41:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:56,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:41:56,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:41:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-06 19:41:56,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:41:56,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900454913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:56,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:41:56,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-06 19:41:56,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595951992] [2024-11-06 19:41:56,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:56,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:41:56,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:56,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:41:56,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:41:56,410 INFO L87 Difference]: Start difference. First operand 3759 states and 5143 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:41:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:58,723 INFO L93 Difference]: Finished difference Result 9769 states and 13912 transitions. [2024-11-06 19:41:58,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:41:58,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2024-11-06 19:41:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:58,748 INFO L225 Difference]: With dead ends: 9769 [2024-11-06 19:41:58,749 INFO L226 Difference]: Without dead ends: 6763 [2024-11-06 19:41:58,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:41:58,755 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 669 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:58,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 402 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 19:41:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2024-11-06 19:41:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763. [2024-11-06 19:41:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.287341023365868) internal successors, (8705), 6762 states have internal predecessors, (8705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:41:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 8705 transitions. [2024-11-06 19:41:58,872 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 8705 transitions. Word has length 193 [2024-11-06 19:41:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:58,873 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 8705 transitions. [2024-11-06 19:41:58,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:41:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 8705 transitions. [2024-11-06 19:41:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-06 19:41:58,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:58,880 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:41:58,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:41:59,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:41:59,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:59,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:59,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1542875905, now seen corresponding path program 1 times [2024-11-06 19:41:59,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:59,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927724310] [2024-11-06 19:41:59,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:59,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 19:41:59,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:59,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927724310] [2024-11-06 19:41:59,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927724310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:59,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:59,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:59,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910532267] [2024-11-06 19:41:59,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:59,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:41:59,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:59,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:41:59,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:41:59,573 INFO L87 Difference]: Start difference. First operand 6763 states and 8705 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:02,727 INFO L93 Difference]: Finished difference Result 15816 states and 21393 transitions. [2024-11-06 19:42:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:42:02,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2024-11-06 19:42:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:02,753 INFO L225 Difference]: With dead ends: 15816 [2024-11-06 19:42:02,753 INFO L226 Difference]: Without dead ends: 9769 [2024-11-06 19:42:02,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:42:02,762 INFO L432 NwaCegarLoop]: 477 mSDtfsCounter, 850 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3465 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 4018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:02,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 492 Invalid, 4018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3465 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-06 19:42:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9769 states. [2024-11-06 19:42:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9769 to 9767. [2024-11-06 19:42:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.272987917263977) internal successors, (12432), 9766 states have internal predecessors, (12432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12432 transitions. [2024-11-06 19:42:02,974 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12432 transitions. Word has length 260 [2024-11-06 19:42:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:02,975 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12432 transitions. [2024-11-06 19:42:02,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12432 transitions. [2024-11-06 19:42:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-06 19:42:02,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:02,980 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:42:02,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:42:02,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:02,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 542708520, now seen corresponding path program 1 times [2024-11-06 19:42:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:02,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69320955] [2024-11-06 19:42:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:02,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-06 19:42:03,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:03,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69320955] [2024-11-06 19:42:03,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69320955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:42:03,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:42:03,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:42:03,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187726485] [2024-11-06 19:42:03,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:42:03,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:42:03,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:42:03,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:42:03,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:03,233 INFO L87 Difference]: Start difference. First operand 9767 states and 12432 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:05,954 INFO L93 Difference]: Finished difference Result 23287 states and 30484 transitions. [2024-11-06 19:42:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:05,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 278 [2024-11-06 19:42:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:05,987 INFO L225 Difference]: With dead ends: 23287 [2024-11-06 19:42:05,987 INFO L226 Difference]: Without dead ends: 14273 [2024-11-06 19:42:05,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:05,997 INFO L432 NwaCegarLoop]: 1386 mSDtfsCounter, 709 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 2874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:05,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1394 Invalid, 2874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:42:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2024-11-06 19:42:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 14273. [2024-11-06 19:42:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14273 states, 14272 states have (on average 1.234515134529148) internal successors, (17619), 14272 states have internal predecessors, (17619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 17619 transitions. [2024-11-06 19:42:06,187 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 17619 transitions. Word has length 278 [2024-11-06 19:42:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:06,187 INFO L471 AbstractCegarLoop]: Abstraction has 14273 states and 17619 transitions. [2024-11-06 19:42:06,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 17619 transitions. [2024-11-06 19:42:06,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-11-06 19:42:06,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:06,200 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, 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, 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, 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] [2024-11-06 19:42:06,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:42:06,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:06,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash 280868765, now seen corresponding path program 1 times [2024-11-06 19:42:06,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:06,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194745311] [2024-11-06 19:42:06,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:06,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-06 19:42:06,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:06,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194745311] [2024-11-06 19:42:06,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194745311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:42:06,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:42:06,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:42:06,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867544853] [2024-11-06 19:42:06,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:42:06,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:42:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:42:06,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:42:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:06,588 INFO L87 Difference]: Start difference. First operand 14273 states and 17619 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:09,169 INFO L93 Difference]: Finished difference Result 39058 states and 48927 transitions. [2024-11-06 19:42:09,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:09,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 311 [2024-11-06 19:42:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:09,226 INFO L225 Difference]: With dead ends: 39058 [2024-11-06 19:42:09,227 INFO L226 Difference]: Without dead ends: 25538 [2024-11-06 19:42:09,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:09,243 INFO L432 NwaCegarLoop]: 591 mSDtfsCounter, 620 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:09,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 597 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 2021 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:42:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25538 states. [2024-11-06 19:42:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25538 to 23285. [2024-11-06 19:42:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.1806820133997595) internal successors, (27491), 23284 states have internal predecessors, (27491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 27491 transitions. [2024-11-06 19:42:09,534 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 27491 transitions. Word has length 311 [2024-11-06 19:42:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:09,536 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 27491 transitions. [2024-11-06 19:42:09,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:09,537 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 27491 transitions. [2024-11-06 19:42:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-11-06 19:42:09,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:09,545 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-06 19:42:09,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:42:09,546 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:09,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:09,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1741842904, now seen corresponding path program 1 times [2024-11-06 19:42:09,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:09,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713544599] [2024-11-06 19:42:09,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:09,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-06 19:42:10,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:10,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713544599] [2024-11-06 19:42:10,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713544599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:42:10,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:42:10,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:42:10,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738566993] [2024-11-06 19:42:10,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:42:10,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:42:10,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:42:10,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:42:10,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:10,637 INFO L87 Difference]: Start difference. First operand 23285 states and 27491 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:13,346 INFO L93 Difference]: Finished difference Result 57082 states and 68684 transitions. [2024-11-06 19:42:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:13,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 390 [2024-11-06 19:42:13,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:13,403 INFO L225 Difference]: With dead ends: 57082 [2024-11-06 19:42:13,404 INFO L226 Difference]: Without dead ends: 34550 [2024-11-06 19:42:13,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:13,425 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 773 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 1074 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 3103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1074 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:13,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 139 Invalid, 3103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1074 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:42:13,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34550 states. [2024-11-06 19:42:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34550 to 32297. [2024-11-06 19:42:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32297 states, 32296 states have (on average 1.2027495665097845) internal successors, (38844), 32296 states have internal predecessors, (38844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32297 states to 32297 states and 38844 transitions. [2024-11-06 19:42:13,787 INFO L78 Accepts]: Start accepts. Automaton has 32297 states and 38844 transitions. Word has length 390 [2024-11-06 19:42:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:13,787 INFO L471 AbstractCegarLoop]: Abstraction has 32297 states and 38844 transitions. [2024-11-06 19:42:13,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 32297 states and 38844 transitions. [2024-11-06 19:42:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-11-06 19:42:13,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:13,797 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2024-11-06 19:42:13,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:42:13,798 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:13,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash 98614002, now seen corresponding path program 1 times [2024-11-06 19:42:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:13,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527888867] [2024-11-06 19:42:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:13,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-06 19:42:14,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:14,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527888867] [2024-11-06 19:42:14,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527888867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:42:14,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:42:14,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:42:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084793345] [2024-11-06 19:42:14,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:42:14,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:42:14,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:42:14,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:42:14,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:14,300 INFO L87 Difference]: Start difference. First operand 32297 states and 38844 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:17,065 INFO L93 Difference]: Finished difference Result 79612 states and 95769 transitions. [2024-11-06 19:42:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:17,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 407 [2024-11-06 19:42:17,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:17,129 INFO L225 Difference]: With dead ends: 79612 [2024-11-06 19:42:17,129 INFO L226 Difference]: Without dead ends: 48068 [2024-11-06 19:42:17,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:17,158 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 734 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:17,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 173 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:42:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48068 states. [2024-11-06 19:42:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48068 to 45064. [2024-11-06 19:42:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45064 states, 45063 states have (on average 1.1978119521558708) internal successors, (53977), 45063 states have internal predecessors, (53977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45064 states to 45064 states and 53977 transitions. [2024-11-06 19:42:17,740 INFO L78 Accepts]: Start accepts. Automaton has 45064 states and 53977 transitions. Word has length 407 [2024-11-06 19:42:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:17,740 INFO L471 AbstractCegarLoop]: Abstraction has 45064 states and 53977 transitions. [2024-11-06 19:42:17,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 45064 states and 53977 transitions. [2024-11-06 19:42:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-11-06 19:42:17,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:17,750 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:42:17,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:42:17,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:17,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:17,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1099135644, now seen corresponding path program 1 times [2024-11-06 19:42:17,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:17,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701699653] [2024-11-06 19:42:17,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:17,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-06 19:42:17,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:17,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701699653] [2024-11-06 19:42:17,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701699653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:42:17,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:42:17,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:42:17,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80914890] [2024-11-06 19:42:17,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:42:17,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:42:17,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:42:17,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:42:17,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:17,978 INFO L87 Difference]: Start difference. First operand 45064 states and 53977 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:20,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:20,741 INFO L93 Difference]: Finished difference Result 90877 states and 108730 transitions. [2024-11-06 19:42:20,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:20,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 427 [2024-11-06 19:42:20,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:20,784 INFO L225 Difference]: With dead ends: 90877 [2024-11-06 19:42:20,784 INFO L226 Difference]: Without dead ends: 46566 [2024-11-06 19:42:20,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:20,812 INFO L432 NwaCegarLoop]: 998 mSDtfsCounter, 829 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 2621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 541 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:20,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1005 Invalid, 2621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [541 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:42:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46566 states. [2024-11-06 19:42:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46566 to 44313. [2024-11-06 19:42:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44313 states, 44312 states have (on average 1.158015887344286) internal successors, (51314), 44312 states have internal predecessors, (51314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44313 states to 44313 states and 51314 transitions. [2024-11-06 19:42:21,269 INFO L78 Accepts]: Start accepts. Automaton has 44313 states and 51314 transitions. Word has length 427 [2024-11-06 19:42:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:21,270 INFO L471 AbstractCegarLoop]: Abstraction has 44313 states and 51314 transitions. [2024-11-06 19:42:21,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 44313 states and 51314 transitions. [2024-11-06 19:42:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2024-11-06 19:42:21,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:21,278 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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] [2024-11-06 19:42:21,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:42:21,278 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:21,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash -238853480, now seen corresponding path program 1 times [2024-11-06 19:42:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096657528] [2024-11-06 19:42:21,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-06 19:42:21,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:21,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096657528] [2024-11-06 19:42:21,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096657528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:42:21,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:42:21,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:42:21,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156374458] [2024-11-06 19:42:21,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:42:21,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:42:21,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:42:21,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:42:21,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:21,826 INFO L87 Difference]: Start difference. First operand 44313 states and 51314 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:24,597 INFO L93 Difference]: Finished difference Result 91628 states and 105846 transitions. [2024-11-06 19:42:24,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:24,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 440 [2024-11-06 19:42:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:24,643 INFO L225 Difference]: With dead ends: 91628 [2024-11-06 19:42:24,643 INFO L226 Difference]: Without dead ends: 48068 [2024-11-06 19:42:24,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:24,667 INFO L432 NwaCegarLoop]: 1257 mSDtfsCounter, 649 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:24,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1265 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:42:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48068 states. [2024-11-06 19:42:25,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48068 to 46566. [2024-11-06 19:42:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46566 states, 46565 states have (on average 1.1437130892301084) internal successors, (53257), 46565 states have internal predecessors, (53257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46566 states to 46566 states and 53257 transitions. [2024-11-06 19:42:25,214 INFO L78 Accepts]: Start accepts. Automaton has 46566 states and 53257 transitions. Word has length 440 [2024-11-06 19:42:25,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:25,215 INFO L471 AbstractCegarLoop]: Abstraction has 46566 states and 53257 transitions. [2024-11-06 19:42:25,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:25,215 INFO L276 IsEmpty]: Start isEmpty. Operand 46566 states and 53257 transitions. [2024-11-06 19:42:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2024-11-06 19:42:25,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:25,223 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 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] [2024-11-06 19:42:25,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:42:25,224 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:25,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:25,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1074035742, now seen corresponding path program 1 times [2024-11-06 19:42:25,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:25,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206989260] [2024-11-06 19:42:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:25,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:25,575 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-06 19:42:25,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:25,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206989260] [2024-11-06 19:42:25,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206989260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:42:25,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:42:25,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:42:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195498059] [2024-11-06 19:42:25,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:42:25,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:42:25,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:42:25,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:42:25,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:25,578 INFO L87 Difference]: Start difference. First operand 46566 states and 53257 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:27,864 INFO L93 Difference]: Finished difference Result 102893 states and 117134 transitions. [2024-11-06 19:42:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:27,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 444 [2024-11-06 19:42:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:27,913 INFO L225 Difference]: With dead ends: 102893 [2024-11-06 19:42:27,913 INFO L226 Difference]: Without dead ends: 53325 [2024-11-06 19:42:27,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:27,931 INFO L432 NwaCegarLoop]: 1316 mSDtfsCounter, 726 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:27,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1323 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 19:42:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53325 states. [2024-11-06 19:42:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53325 to 52574. [2024-11-06 19:42:28,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52574 states, 52573 states have (on average 1.1233332699294314) internal successors, (59057), 52573 states have internal predecessors, (59057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52574 states to 52574 states and 59057 transitions. [2024-11-06 19:42:28,306 INFO L78 Accepts]: Start accepts. Automaton has 52574 states and 59057 transitions. Word has length 444 [2024-11-06 19:42:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:28,307 INFO L471 AbstractCegarLoop]: Abstraction has 52574 states and 59057 transitions. [2024-11-06 19:42:28,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 52574 states and 59057 transitions. [2024-11-06 19:42:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2024-11-06 19:42:28,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:28,312 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-06 19:42:28,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:42:28,312 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:28,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1113868765, now seen corresponding path program 1 times [2024-11-06 19:42:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:28,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192533537] [2024-11-06 19:42:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:28,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2024-11-06 19:42:28,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:28,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192533537] [2024-11-06 19:42:28,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192533537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:42:28,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:42:28,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:42:28,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317885322] [2024-11-06 19:42:28,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:42:28,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:42:28,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:42:28,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:42:28,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:28,639 INFO L87 Difference]: Start difference. First operand 52574 states and 59057 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:30,916 INFO L93 Difference]: Finished difference Result 120917 states and 136212 transitions. [2024-11-06 19:42:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:30,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 445 [2024-11-06 19:42:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:30,992 INFO L225 Difference]: With dead ends: 120917 [2024-11-06 19:42:30,992 INFO L226 Difference]: Without dead ends: 69096 [2024-11-06 19:42:31,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:31,029 INFO L432 NwaCegarLoop]: 1181 mSDtfsCounter, 698 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2211 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 2211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:31,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1189 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 2211 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 19:42:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69096 states. [2024-11-06 19:42:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69096 to 68345. [2024-11-06 19:42:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68345 states, 68344 states have (on average 1.1071637598033477) internal successors, (75668), 68344 states have internal predecessors, (75668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68345 states to 68345 states and 75668 transitions. [2024-11-06 19:42:31,699 INFO L78 Accepts]: Start accepts. Automaton has 68345 states and 75668 transitions. Word has length 445 [2024-11-06 19:42:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:31,699 INFO L471 AbstractCegarLoop]: Abstraction has 68345 states and 75668 transitions. [2024-11-06 19:42:31,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 68345 states and 75668 transitions. [2024-11-06 19:42:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2024-11-06 19:42:31,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:31,704 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-06 19:42:31,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:42:31,704 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:31,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:31,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1553708824, now seen corresponding path program 1 times [2024-11-06 19:42:31,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:31,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234012212] [2024-11-06 19:42:31,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:31,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-11-06 19:42:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234012212] [2024-11-06 19:42:32,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234012212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:42:32,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:42:32,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:42:32,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238208814] [2024-11-06 19:42:32,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:42:32,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:42:32,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:42:32,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:42:32,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:32,167 INFO L87 Difference]: Start difference. First operand 68345 states and 75668 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:35,230 INFO L93 Difference]: Finished difference Result 179495 states and 199337 transitions. [2024-11-06 19:42:35,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:35,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 447 [2024-11-06 19:42:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:35,356 INFO L225 Difference]: With dead ends: 179495 [2024-11-06 19:42:35,356 INFO L226 Difference]: Without dead ends: 111903 [2024-11-06 19:42:35,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:35,380 INFO L432 NwaCegarLoop]: 1286 mSDtfsCounter, 684 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:35,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1294 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:42:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111903 states. [2024-11-06 19:42:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111903 to 99887. [2024-11-06 19:42:36,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99887 states, 99886 states have (on average 1.0905732535090003) internal successors, (108933), 99886 states have internal predecessors, (108933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99887 states to 99887 states and 108933 transitions. [2024-11-06 19:42:36,343 INFO L78 Accepts]: Start accepts. Automaton has 99887 states and 108933 transitions. Word has length 447 [2024-11-06 19:42:36,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:36,343 INFO L471 AbstractCegarLoop]: Abstraction has 99887 states and 108933 transitions. [2024-11-06 19:42:36,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 99887 states and 108933 transitions. [2024-11-06 19:42:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2024-11-06 19:42:36,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:36,350 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-06 19:42:36,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:42:36,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:36,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:36,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1667626267, now seen corresponding path program 1 times [2024-11-06 19:42:36,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:36,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737787948] [2024-11-06 19:42:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-06 19:42:36,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:36,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737787948] [2024-11-06 19:42:36,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737787948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:42:36,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:42:36,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:42:36,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872722220] [2024-11-06 19:42:36,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:42:36,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:42:36,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:42:36,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:42:36,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:36,780 INFO L87 Difference]: Start difference. First operand 99887 states and 108933 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:39,407 INFO L93 Difference]: Finished difference Result 200523 states and 218616 transitions. [2024-11-06 19:42:39,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:39,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 497 [2024-11-06 19:42:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:39,523 INFO L225 Difference]: With dead ends: 200523 [2024-11-06 19:42:39,523 INFO L226 Difference]: Without dead ends: 101389 [2024-11-06 19:42:39,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:39,584 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 792 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2173 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 2173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:39,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 219 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 2173 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 19:42:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101389 states. [2024-11-06 19:42:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101389 to 94630. [2024-11-06 19:42:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94630 states, 94629 states have (on average 1.0756216381870252) internal successors, (101785), 94629 states have internal predecessors, (101785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94630 states to 94630 states and 101785 transitions. [2024-11-06 19:42:40,664 INFO L78 Accepts]: Start accepts. Automaton has 94630 states and 101785 transitions. Word has length 497 [2024-11-06 19:42:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:40,664 INFO L471 AbstractCegarLoop]: Abstraction has 94630 states and 101785 transitions. [2024-11-06 19:42:40,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 94630 states and 101785 transitions. [2024-11-06 19:42:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2024-11-06 19:42:40,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:40,670 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-06 19:42:40,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:42:40,670 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:40,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:40,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1238147040, now seen corresponding path program 1 times [2024-11-06 19:42:40,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:40,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986453592] [2024-11-06 19:42:40,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:40,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-06 19:42:40,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:40,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986453592] [2024-11-06 19:42:40,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986453592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:42:40,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:42:40,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:42:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63431254] [2024-11-06 19:42:40,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:42:40,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:42:40,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:42:40,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:42:40,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:40,954 INFO L87 Difference]: Start difference. First operand 94630 states and 101785 transitions. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:43,943 INFO L93 Difference]: Finished difference Result 188507 states and 202812 transitions. [2024-11-06 19:42:43,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:43,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 510 [2024-11-06 19:42:43,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:44,054 INFO L225 Difference]: With dead ends: 188507 [2024-11-06 19:42:44,054 INFO L226 Difference]: Without dead ends: 94630 [2024-11-06 19:42:44,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:44,103 INFO L432 NwaCegarLoop]: 1236 mSDtfsCounter, 567 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:44,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1244 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 2188 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:42:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94630 states. [2024-11-06 19:42:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94630 to 90875. [2024-11-06 19:42:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90875 states, 90874 states have (on average 1.0538767964434272) internal successors, (95770), 90874 states have internal predecessors, (95770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90875 states to 90875 states and 95770 transitions. [2024-11-06 19:42:45,330 INFO L78 Accepts]: Start accepts. Automaton has 90875 states and 95770 transitions. Word has length 510 [2024-11-06 19:42:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:45,330 INFO L471 AbstractCegarLoop]: Abstraction has 90875 states and 95770 transitions. [2024-11-06 19:42:45,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 90875 states and 95770 transitions. [2024-11-06 19:42:45,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2024-11-06 19:42:45,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:45,337 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-11-06 19:42:45,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:42:45,337 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:45,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:45,338 INFO L85 PathProgramCache]: Analyzing trace with hash -931907824, now seen corresponding path program 1 times [2024-11-06 19:42:45,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:45,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231771929] [2024-11-06 19:42:45,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:45,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-11-06 19:42:45,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:45,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231771929] [2024-11-06 19:42:45,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231771929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:42:45,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:42:45,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:42:45,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736221047] [2024-11-06 19:42:45,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:42:45,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:42:45,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:42:45,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:42:45,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:45,523 INFO L87 Difference]: Start difference. First operand 90875 states and 95770 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:48,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:48,042 INFO L93 Difference]: Finished difference Result 197519 states and 208360 transitions. [2024-11-06 19:42:48,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:48,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 528 [2024-11-06 19:42:48,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:48,160 INFO L225 Difference]: With dead ends: 197519 [2024-11-06 19:42:48,161 INFO L226 Difference]: Without dead ends: 107397 [2024-11-06 19:42:48,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:48,213 INFO L432 NwaCegarLoop]: 1109 mSDtfsCounter, 826 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:48,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1117 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 2116 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 19:42:48,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107397 states. [2024-11-06 19:42:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107397 to 102891. [2024-11-06 19:42:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102891 states, 102890 states have (on average 1.05103508601419) internal successors, (108141), 102890 states have internal predecessors, (108141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102891 states to 102891 states and 108141 transitions. [2024-11-06 19:42:49,628 INFO L78 Accepts]: Start accepts. Automaton has 102891 states and 108141 transitions. Word has length 528 [2024-11-06 19:42:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:49,629 INFO L471 AbstractCegarLoop]: Abstraction has 102891 states and 108141 transitions. [2024-11-06 19:42:49,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:49,629 INFO L276 IsEmpty]: Start isEmpty. Operand 102891 states and 108141 transitions. [2024-11-06 19:42:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-11-06 19:42:49,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:49,644 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:42:49,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 19:42:49,644 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:49,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash -233960246, now seen corresponding path program 1 times [2024-11-06 19:42:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:49,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176298080] [2024-11-06 19:42:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:49,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 596 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-11-06 19:42:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:49,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176298080] [2024-11-06 19:42:49,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176298080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:42:49,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:42:49,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:42:49,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447738598] [2024-11-06 19:42:49,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:42:49,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:42:49,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:42:49,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:42:49,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:49,919 INFO L87 Difference]: Start difference. First operand 102891 states and 108141 transitions. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:42:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:53,026 INFO L93 Difference]: Finished difference Result 253093 states and 266882 transitions. [2024-11-06 19:42:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:53,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 706 [2024-11-06 19:42:53,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:53,173 INFO L225 Difference]: With dead ends: 253093 [2024-11-06 19:42:53,173 INFO L226 Difference]: Without dead ends: 150955 [2024-11-06 19:42:53,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:42:53,211 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 608 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:53,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 398 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:42:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150955 states.