./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label58.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_label58.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', '58e74a4dd86a124eeee2194e768898c8688a10c1933d2ce8d825a1d945ebd262'] 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_label58.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 58e74a4dd86a124eeee2194e768898c8688a10c1933d2ce8d825a1d945ebd262 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:45:47,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:45:47,669 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:45:47,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:45:47,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:45:47,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:45:47,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:45:47,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:45:47,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:45:47,714 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:45:47,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:45:47,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:45:47,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:45:47,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:45:47,716 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:45:47,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:45:47,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:45:47,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:45:47,717 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:45:47,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:45:47,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:45:47,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:45:47,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:45:47,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:45:47,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:45:47,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:45:47,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:45:47,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:45:47,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:45:47,719 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 -> 58e74a4dd86a124eeee2194e768898c8688a10c1933d2ce8d825a1d945ebd262 [2024-11-06 19:45:47,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:45:47,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:45:47,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:45:47,972 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:45:47,972 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:45:47,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label58.c [2024-11-06 19:45:49,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:45:49,746 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:45:49,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label58.c [2024-11-06 19:45:49,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/917754df0/1aa68c79a9214d1bac6ae850470a7f1b/FLAG555c083d8 [2024-11-06 19:45:49,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/917754df0/1aa68c79a9214d1bac6ae850470a7f1b [2024-11-06 19:45:49,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:45:49,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:45:49,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:45:49,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:45:49,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:45:49,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:45:49" (1/1) ... [2024-11-06 19:45:49,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6f264d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:49, skipping insertion in model container [2024-11-06 19:45:49,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:45:49" (1/1) ... [2024-11-06 19:45:49,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:45:50,263 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_label58.c[4474,4487] [2024-11-06 19:45:50,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:45:50,897 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:45:50,920 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_label58.c[4474,4487] [2024-11-06 19:45:51,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:45:51,259 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:45:51,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51 WrapperNode [2024-11-06 19:45:51,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:45:51,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:45:51,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:45:51,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:45:51,266 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:45:51" (1/1) ... [2024-11-06 19:45:51,308 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:45:51" (1/1) ... [2024-11-06 19:45:51,698 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-11-06 19:45:51,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:45:51,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:45:51,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:45:51,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:45:51,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:51,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:51,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:51,934 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:45:51,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:51,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:45:52,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:45:52,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:45:52,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:45:52,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:45:52,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:45:52,341 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:45:52,344 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:45:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:45:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:45:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:45:52,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:45:52,442 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:45:52,443 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:45:56,750 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-06 19:45:56,751 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:45:56,786 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:45:56,786 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:45:56,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:45:56 BoogieIcfgContainer [2024-11-06 19:45:56,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:45:56,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:45:56,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:45:56,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:45:56,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:45:49" (1/3) ... [2024-11-06 19:45:56,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f9d262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:45:56, skipping insertion in model container [2024-11-06 19:45:56,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (2/3) ... [2024-11-06 19:45:56,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14f9d262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:45:56, skipping insertion in model container [2024-11-06 19:45:56,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:45:56" (3/3) ... [2024-11-06 19:45:56,797 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label58.c [2024-11-06 19:45:56,813 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:45:56,813 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:45:56,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:45:56,897 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;@145dad6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:45:56,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:45:56,907 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:45:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-06 19:45:56,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:56,913 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] [2024-11-06 19:45:56,914 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:56,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:56,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2024-11-06 19:45:56,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:56,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827987486] [2024-11-06 19:45:56,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:56,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:57,230 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:45:57,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827987486] [2024-11-06 19:45:57,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827987486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:57,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:57,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:45:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785530825] [2024-11-06 19:45:57,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:57,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:57,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:57,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:57,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:57,261 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 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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:46:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:00,884 INFO L93 Difference]: Finished difference Result 2388 states and 4629 transitions. [2024-11-06 19:46:00,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:00,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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 34 [2024-11-06 19:46:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:00,908 INFO L225 Difference]: With dead ends: 2388 [2024-11-06 19:46:00,908 INFO L226 Difference]: Without dead ends: 1506 [2024-11-06 19:46:00,913 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:46:00,915 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 825 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:00,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 102 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-06 19:46:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-06 19:46:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2024-11-06 19:46:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.869767441860465) internal successors, (2814), 1505 states have internal predecessors, (2814), 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:46:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2814 transitions. [2024-11-06 19:46:01,011 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2814 transitions. Word has length 34 [2024-11-06 19:46:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:01,011 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2814 transitions. [2024-11-06 19:46:01,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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:46:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2814 transitions. [2024-11-06 19:46:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-06 19:46:01,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:01,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:01,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:46:01,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:01,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:01,016 INFO L85 PathProgramCache]: Analyzing trace with hash 926035172, now seen corresponding path program 1 times [2024-11-06 19:46:01,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:01,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497045575] [2024-11-06 19:46:01,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:01,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:46:01,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:01,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497045575] [2024-11-06 19:46:01,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497045575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:01,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:01,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:46:01,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838268316] [2024-11-06 19:46:01,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:01,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:01,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:01,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:01,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:01,342 INFO L87 Difference]: Start difference. First operand 1506 states and 2814 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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:46:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:04,311 INFO L93 Difference]: Finished difference Result 4514 states and 8438 transitions. [2024-11-06 19:46:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:04,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 107 [2024-11-06 19:46:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:04,325 INFO L225 Difference]: With dead ends: 4514 [2024-11-06 19:46:04,325 INFO L226 Difference]: Without dead ends: 3010 [2024-11-06 19:46:04,327 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:46:04,331 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 918 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:04,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 354 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:46:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2024-11-06 19:46:04,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 3008. [2024-11-06 19:46:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.6531426671100764) internal successors, (4971), 3007 states have internal predecessors, (4971), 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:46:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4971 transitions. [2024-11-06 19:46:04,411 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4971 transitions. Word has length 107 [2024-11-06 19:46:04,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:04,412 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4971 transitions. [2024-11-06 19:46:04,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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:46:04,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4971 transitions. [2024-11-06 19:46:04,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-06 19:46:04,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:04,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:04,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:46:04,419 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:04,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:04,420 INFO L85 PathProgramCache]: Analyzing trace with hash -336797985, now seen corresponding path program 1 times [2024-11-06 19:46:04,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:04,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420007419] [2024-11-06 19:46:04,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:04,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:46:04,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:04,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420007419] [2024-11-06 19:46:04,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420007419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:04,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:04,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:04,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234197425] [2024-11-06 19:46:04,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:04,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:46:04,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:04,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:46:04,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:46:04,874 INFO L87 Difference]: Start difference. First operand 3008 states and 4971 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 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:46:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:09,293 INFO L93 Difference]: Finished difference Result 8267 states and 13429 transitions. [2024-11-06 19:46:09,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:46:09,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 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 120 [2024-11-06 19:46:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:09,314 INFO L225 Difference]: With dead ends: 8267 [2024-11-06 19:46:09,314 INFO L226 Difference]: Without dead ends: 5261 [2024-11-06 19:46:09,319 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:46:09,320 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 2154 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4998 mSolverCounterSat, 851 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2154 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 5849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 851 IncrementalHoareTripleChecker+Valid, 4998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:09,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2154 Valid, 353 Invalid, 5849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [851 Valid, 4998 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-06 19:46:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5261 states. [2024-11-06 19:46:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5261 to 5261. [2024-11-06 19:46:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 5260 states have (on average 1.5102661596958176) internal successors, (7944), 5260 states have internal predecessors, (7944), 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:46:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 7944 transitions. [2024-11-06 19:46:09,410 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 7944 transitions. Word has length 120 [2024-11-06 19:46:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:09,411 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 7944 transitions. [2024-11-06 19:46:09,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 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:46:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 7944 transitions. [2024-11-06 19:46:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-06 19:46:09,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:09,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:09,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:46:09,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:09,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:09,414 INFO L85 PathProgramCache]: Analyzing trace with hash -174135366, now seen corresponding path program 1 times [2024-11-06 19:46:09,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:09,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223304195] [2024-11-06 19:46:09,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:09,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 19:46:09,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:09,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223304195] [2024-11-06 19:46:09,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223304195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:46:09,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905883194] [2024-11-06 19:46:09,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:09,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:46:09,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:46:09,855 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:46:09,856 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:46:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:09,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:46:09,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:46:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-06 19:46:10,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:46:10,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905883194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:10,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:46:10,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-06 19:46:10,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238920789] [2024-11-06 19:46:10,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:10,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:10,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:10,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:10,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:46:10,210 INFO L87 Difference]: Start difference. First operand 5261 states and 7944 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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:46:12,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:12,766 INFO L93 Difference]: Finished difference Result 14275 states and 22313 transitions. [2024-11-06 19:46:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:12,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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 175 [2024-11-06 19:46:12,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:12,790 INFO L225 Difference]: With dead ends: 14275 [2024-11-06 19:46:12,790 INFO L226 Difference]: Without dead ends: 9767 [2024-11-06 19:46:12,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 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:46:12,795 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 621 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 3041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:12,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 666 Invalid, 3041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:46:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2024-11-06 19:46:12,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2024-11-06 19:46:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.3878763055498669) internal successors, (13554), 9766 states have internal predecessors, (13554), 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:46:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 13554 transitions. [2024-11-06 19:46:12,955 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 13554 transitions. Word has length 175 [2024-11-06 19:46:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:12,957 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 13554 transitions. [2024-11-06 19:46:12,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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:46:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 13554 transitions. [2024-11-06 19:46:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-06 19:46:12,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:12,961 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:46:12,978 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:46:13,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:46:13,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:13,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1562246478, now seen corresponding path program 1 times [2024-11-06 19:46:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:13,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042016764] [2024-11-06 19:46:13,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:13,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:46:13,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:13,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042016764] [2024-11-06 19:46:13,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042016764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:13,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:13,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:13,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210431072] [2024-11-06 19:46:13,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:13,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:46:13,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:13,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:46:13,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:46:13,493 INFO L87 Difference]: Start difference. First operand 9767 states and 13554 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:46:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:16,525 INFO L93 Difference]: Finished difference Result 23324 states and 32177 transitions. [2024-11-06 19:46:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:46:16,526 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 191 [2024-11-06 19:46:16,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:16,565 INFO L225 Difference]: With dead ends: 23324 [2024-11-06 19:46:16,565 INFO L226 Difference]: Without dead ends: 14273 [2024-11-06 19:46:16,572 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:46:16,573 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:16,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:46:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2024-11-06 19:46:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 14273. [2024-11-06 19:46:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14273 states, 14272 states have (on average 1.2779568385650224) internal successors, (18239), 14272 states have internal predecessors, (18239), 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:46:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 18239 transitions. [2024-11-06 19:46:16,782 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 18239 transitions. Word has length 191 [2024-11-06 19:46:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:16,782 INFO L471 AbstractCegarLoop]: Abstraction has 14273 states and 18239 transitions. [2024-11-06 19:46:16,782 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:46:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 18239 transitions. [2024-11-06 19:46:16,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-06 19:46:16,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:16,785 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:46:16,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:46:16,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:16,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:16,786 INFO L85 PathProgramCache]: Analyzing trace with hash -204140523, now seen corresponding path program 1 times [2024-11-06 19:46:16,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:16,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32002309] [2024-11-06 19:46:16,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:16,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-06 19:46:17,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:17,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32002309] [2024-11-06 19:46:17,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32002309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:17,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:17,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:17,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487900426] [2024-11-06 19:46:17,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:17,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:17,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:17,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:17,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:17,041 INFO L87 Difference]: Start difference. First operand 14273 states and 18239 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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:46:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:19,836 INFO L93 Difference]: Finished difference Result 39058 states and 50794 transitions. [2024-11-06 19:46:19,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:19,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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 265 [2024-11-06 19:46:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:19,893 INFO L225 Difference]: With dead ends: 39058 [2024-11-06 19:46:19,894 INFO L226 Difference]: Without dead ends: 25538 [2024-11-06 19:46:19,911 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:46:19,913 INFO L432 NwaCegarLoop]: 1283 mSDtfsCounter, 732 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 3017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:19,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 1291 Invalid, 3017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:46:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25538 states. [2024-11-06 19:46:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25538 to 25538. [2024-11-06 19:46:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25538 states, 25537 states have (on average 1.2637741316521127) internal successors, (32273), 25537 states have internal predecessors, (32273), 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:46:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25538 states to 25538 states and 32273 transitions. [2024-11-06 19:46:20,274 INFO L78 Accepts]: Start accepts. Automaton has 25538 states and 32273 transitions. Word has length 265 [2024-11-06 19:46:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:20,274 INFO L471 AbstractCegarLoop]: Abstraction has 25538 states and 32273 transitions. [2024-11-06 19:46:20,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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:46:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 25538 states and 32273 transitions. [2024-11-06 19:46:20,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-06 19:46:20,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:20,284 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:46:20,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:46:20,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:20,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:20,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1617672100, now seen corresponding path program 1 times [2024-11-06 19:46:20,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:20,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295528929] [2024-11-06 19:46:20,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:20,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-06 19:46:20,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295528929] [2024-11-06 19:46:20,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295528929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:20,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:20,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:46:20,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052934649] [2024-11-06 19:46:20,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:20,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:20,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:20,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:20,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:20,540 INFO L87 Difference]: Start difference. First operand 25538 states and 32273 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 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:46:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:23,131 INFO L93 Difference]: Finished difference Result 50323 states and 63788 transitions. [2024-11-06 19:46:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:23,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 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 323 [2024-11-06 19:46:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:23,175 INFO L225 Difference]: With dead ends: 50323 [2024-11-06 19:46:23,176 INFO L226 Difference]: Without dead ends: 25538 [2024-11-06 19:46:23,196 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:46:23,196 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 690 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:23,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 427 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:46:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25538 states. [2024-11-06 19:46:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25538 to 21783. [2024-11-06 19:46:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21783 states, 21782 states have (on average 1.1813883022679277) internal successors, (25733), 21782 states have internal predecessors, (25733), 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:46:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21783 states to 21783 states and 25733 transitions. [2024-11-06 19:46:23,439 INFO L78 Accepts]: Start accepts. Automaton has 21783 states and 25733 transitions. Word has length 323 [2024-11-06 19:46:23,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:23,440 INFO L471 AbstractCegarLoop]: Abstraction has 21783 states and 25733 transitions. [2024-11-06 19:46:23,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 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:46:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 21783 states and 25733 transitions. [2024-11-06 19:46:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-11-06 19:46:23,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:23,449 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, 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, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:46:23,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:46:23,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:23,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:23,451 INFO L85 PathProgramCache]: Analyzing trace with hash -638290817, now seen corresponding path program 1 times [2024-11-06 19:46:23,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:23,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37600126] [2024-11-06 19:46:23,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:23,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 136 proven. 230 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-06 19:46:24,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:24,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37600126] [2024-11-06 19:46:24,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37600126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:46:24,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764723672] [2024-11-06 19:46:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:24,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:46:24,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:46:24,028 INFO L229 MonitoredProcess]: Starting monitored process 3 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:46:24,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 19:46:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:24,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:46:24,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:46:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-06 19:46:24,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:46:24,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764723672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:24,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:46:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:46:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474472368] [2024-11-06 19:46:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:24,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:24,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:24,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:24,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:46:24,409 INFO L87 Difference]: Start difference. First operand 21783 states and 25733 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:46:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:27,130 INFO L93 Difference]: Finished difference Result 58584 states and 70114 transitions. [2024-11-06 19:46:27,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:27,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 413 [2024-11-06 19:46:27,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:27,186 INFO L225 Difference]: With dead ends: 58584 [2024-11-06 19:46:27,186 INFO L226 Difference]: Without dead ends: 37554 [2024-11-06 19:46:27,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:46:27,204 INFO L432 NwaCegarLoop]: 937 mSDtfsCounter, 670 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:27,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 944 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:46:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37554 states. [2024-11-06 19:46:27,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37554 to 37554. [2024-11-06 19:46:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37554 states, 37553 states have (on average 1.1895454424413496) internal successors, (44671), 37553 states have internal predecessors, (44671), 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:46:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37554 states to 37554 states and 44671 transitions. [2024-11-06 19:46:27,702 INFO L78 Accepts]: Start accepts. Automaton has 37554 states and 44671 transitions. Word has length 413 [2024-11-06 19:46:27,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:27,703 INFO L471 AbstractCegarLoop]: Abstraction has 37554 states and 44671 transitions. [2024-11-06 19:46:27,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:46:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 37554 states and 44671 transitions. [2024-11-06 19:46:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2024-11-06 19:46:27,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:27,711 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:27,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 19:46:27,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:46:27,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:27,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:27,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2032909390, now seen corresponding path program 1 times [2024-11-06 19:46:27,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:27,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540889573] [2024-11-06 19:46:27,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:27,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 462 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-06 19:46:28,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:28,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540889573] [2024-11-06 19:46:28,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540889573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:28,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:28,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:28,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979104279] [2024-11-06 19:46:28,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:28,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:28,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:28,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:28,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:28,183 INFO L87 Difference]: Start difference. First operand 37554 states and 44671 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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:46:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:30,679 INFO L93 Difference]: Finished difference Result 95383 states and 114715 transitions. [2024-11-06 19:46:30,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:30,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 414 [2024-11-06 19:46:30,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:30,755 INFO L225 Difference]: With dead ends: 95383 [2024-11-06 19:46:30,755 INFO L226 Difference]: Without dead ends: 58582 [2024-11-06 19:46:30,787 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:46:30,788 INFO L432 NwaCegarLoop]: 1219 mSDtfsCounter, 703 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:30,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1227 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 19:46:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58582 states. [2024-11-06 19:46:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58582 to 57080. [2024-11-06 19:46:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57080 states, 57079 states have (on average 1.1586397799540986) internal successors, (66134), 57079 states have internal predecessors, (66134), 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:46:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57080 states to 57080 states and 66134 transitions. [2024-11-06 19:46:31,491 INFO L78 Accepts]: Start accepts. Automaton has 57080 states and 66134 transitions. Word has length 414 [2024-11-06 19:46:31,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:31,491 INFO L471 AbstractCegarLoop]: Abstraction has 57080 states and 66134 transitions. [2024-11-06 19:46:31,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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:46:31,491 INFO L276 IsEmpty]: Start isEmpty. Operand 57080 states and 66134 transitions. [2024-11-06 19:46:31,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2024-11-06 19:46:31,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:31,499 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:46:31,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:46:31,499 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:31,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:31,499 INFO L85 PathProgramCache]: Analyzing trace with hash 569812594, now seen corresponding path program 1 times [2024-11-06 19:46:31,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:31,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683168722] [2024-11-06 19:46:31,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:31,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-06 19:46:31,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:31,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683168722] [2024-11-06 19:46:31,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683168722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:31,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:31,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:31,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491488265] [2024-11-06 19:46:31,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:31,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:31,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:31,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:31,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:31,714 INFO L87 Difference]: Start difference. First operand 57080 states and 66134 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:46:34,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:34,893 INFO L93 Difference]: Finished difference Result 149455 states and 174891 transitions. [2024-11-06 19:46:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:34,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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 420 [2024-11-06 19:46:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:34,992 INFO L225 Difference]: With dead ends: 149455 [2024-11-06 19:46:34,993 INFO L226 Difference]: Without dead ends: 93128 [2024-11-06 19:46:35,040 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:46:35,041 INFO L432 NwaCegarLoop]: 529 mSDtfsCounter, 707 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 643 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 643 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:35,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 536 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [643 Valid, 2288 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 19:46:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93128 states. [2024-11-06 19:46:35,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93128 to 84116. [2024-11-06 19:46:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84116 states, 84115 states have (on average 1.1430422635677346) internal successors, (96147), 84115 states have internal predecessors, (96147), 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:46:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84116 states to 84116 states and 96147 transitions. [2024-11-06 19:46:36,108 INFO L78 Accepts]: Start accepts. Automaton has 84116 states and 96147 transitions. Word has length 420 [2024-11-06 19:46:36,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:36,109 INFO L471 AbstractCegarLoop]: Abstraction has 84116 states and 96147 transitions. [2024-11-06 19:46:36,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:46:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 84116 states and 96147 transitions. [2024-11-06 19:46:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2024-11-06 19:46:36,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:36,126 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:46:36,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:46:36,127 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:36,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1856209863, now seen corresponding path program 1 times [2024-11-06 19:46:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359323498] [2024-11-06 19:46:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:36,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-06 19:46:36,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:36,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359323498] [2024-11-06 19:46:36,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359323498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:36,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:36,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:36,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606052701] [2024-11-06 19:46:36,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:36,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:36,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:36,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:36,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:36,682 INFO L87 Difference]: Start difference. First operand 84116 states and 96147 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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:46:39,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:39,628 INFO L93 Difference]: Finished difference Result 202776 states and 233283 transitions. [2024-11-06 19:46:39,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:39,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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 519 [2024-11-06 19:46:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:39,771 INFO L225 Difference]: With dead ends: 202776 [2024-11-06 19:46:39,771 INFO L226 Difference]: Without dead ends: 119413 [2024-11-06 19:46:39,816 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:46:39,817 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 561 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:39,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1260 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:46:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119413 states. [2024-11-06 19:46:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119413 to 109650. [2024-11-06 19:46:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109650 states, 109649 states have (on average 1.124460779396073) internal successors, (123296), 109649 states have internal predecessors, (123296), 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:46:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109650 states to 109650 states and 123296 transitions. [2024-11-06 19:46:41,029 INFO L78 Accepts]: Start accepts. Automaton has 109650 states and 123296 transitions. Word has length 519 [2024-11-06 19:46:41,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:41,030 INFO L471 AbstractCegarLoop]: Abstraction has 109650 states and 123296 transitions. [2024-11-06 19:46:41,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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:46:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 109650 states and 123296 transitions. [2024-11-06 19:46:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2024-11-06 19:46:41,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:41,045 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, 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, 2, 2, 2, 2, 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] [2024-11-06 19:46:41,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:46:41,046 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:41,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:41,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1413183668, now seen corresponding path program 1 times [2024-11-06 19:46:41,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:41,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128563851] [2024-11-06 19:46:41,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:41,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-11-06 19:46:41,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:41,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128563851] [2024-11-06 19:46:41,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128563851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:41,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:41,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:41,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167155887] [2024-11-06 19:46:41,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:41,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:41,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:41,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:41,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:41,502 INFO L87 Difference]: Start difference. First operand 109650 states and 123296 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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:46:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:44,180 INFO L93 Difference]: Finished difference Result 238073 states and 267462 transitions. [2024-11-06 19:46:44,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:44,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 525 [2024-11-06 19:46:44,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:44,323 INFO L225 Difference]: With dead ends: 238073 [2024-11-06 19:46:44,323 INFO L226 Difference]: Without dead ends: 129176 [2024-11-06 19:46:44,381 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:46:44,382 INFO L432 NwaCegarLoop]: 1109 mSDtfsCounter, 840 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:44,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1117 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 19:46:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129176 states. [2024-11-06 19:46:45,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129176 to 128425. [2024-11-06 19:46:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128425 states, 128424 states have (on average 1.1099482962686102) internal successors, (142544), 128424 states have internal predecessors, (142544), 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:46:46,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128425 states to 128425 states and 142544 transitions. [2024-11-06 19:46:46,247 INFO L78 Accepts]: Start accepts. Automaton has 128425 states and 142544 transitions. Word has length 525 [2024-11-06 19:46:46,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:46,247 INFO L471 AbstractCegarLoop]: Abstraction has 128425 states and 142544 transitions. [2024-11-06 19:46:46,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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:46:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 128425 states and 142544 transitions. [2024-11-06 19:46:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2024-11-06 19:46:46,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:46,263 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, 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, 2, 2, 2, 2, 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] [2024-11-06 19:46:46,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:46:46,264 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:46,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:46,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1335933603, now seen corresponding path program 1 times [2024-11-06 19:46:46,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:46,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614530111] [2024-11-06 19:46:46,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:46,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-06 19:46:46,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:46,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614530111] [2024-11-06 19:46:46,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614530111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:46,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:46,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:46,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307750223] [2024-11-06 19:46:46,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:46,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:46,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:46,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:46,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:46,749 INFO L87 Difference]: Start difference. First operand 128425 states and 142544 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:46:49,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:49,463 INFO L93 Difference]: Finished difference Result 259101 states and 287396 transitions. [2024-11-06 19:46:49,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:49,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 576 [2024-11-06 19:46:49,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:49,594 INFO L225 Difference]: With dead ends: 259101 [2024-11-06 19:46:49,594 INFO L226 Difference]: Without dead ends: 127674 [2024-11-06 19:46:49,656 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:46:49,656 INFO L432 NwaCegarLoop]: 1228 mSDtfsCounter, 606 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:49,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1235 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 19:46:49,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127674 states. [2024-11-06 19:46:50,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127674 to 110401. [2024-11-06 19:46:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110401 states, 110400 states have (on average 1.07125) internal successors, (118266), 110400 states have internal predecessors, (118266), 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:46:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110401 states to 110401 states and 118266 transitions. [2024-11-06 19:46:51,070 INFO L78 Accepts]: Start accepts. Automaton has 110401 states and 118266 transitions. Word has length 576 [2024-11-06 19:46:51,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:51,070 INFO L471 AbstractCegarLoop]: Abstraction has 110401 states and 118266 transitions. [2024-11-06 19:46:51,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:46:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 110401 states and 118266 transitions. [2024-11-06 19:46:51,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2024-11-06 19:46:51,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:51,088 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:46:51,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:46:51,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:51,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:51,089 INFO L85 PathProgramCache]: Analyzing trace with hash -605365794, now seen corresponding path program 1 times [2024-11-06 19:46:51,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:51,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913541161] [2024-11-06 19:46:51,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:51,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-06 19:46:51,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:51,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913541161] [2024-11-06 19:46:51,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913541161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:51,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:51,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:51,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217176853] [2024-11-06 19:46:51,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:51,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:51,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:51,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:51,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:51,567 INFO L87 Difference]: Start difference. First operand 110401 states and 118266 transitions. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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:46:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:54,412 INFO L93 Difference]: Finished difference Result 248587 states and 266801 transitions. [2024-11-06 19:46:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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 605 [2024-11-06 19:46:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:54,550 INFO L225 Difference]: With dead ends: 248587 [2024-11-06 19:46:54,550 INFO L226 Difference]: Without dead ends: 138939 [2024-11-06 19:46:54,597 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:46:54,597 INFO L432 NwaCegarLoop]: 1266 mSDtfsCounter, 667 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:54,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1273 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:46:54,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138939 states. [2024-11-06 19:46:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138939 to 127674. [2024-11-06 19:46:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127674 states, 127673 states have (on average 1.0658714058571508) internal successors, (136083), 127673 states have internal predecessors, (136083), 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:46:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127674 states to 127674 states and 136083 transitions. [2024-11-06 19:46:56,049 INFO L78 Accepts]: Start accepts. Automaton has 127674 states and 136083 transitions. Word has length 605 [2024-11-06 19:46:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:56,049 INFO L471 AbstractCegarLoop]: Abstraction has 127674 states and 136083 transitions. [2024-11-06 19:46:56,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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:46:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 127674 states and 136083 transitions. [2024-11-06 19:46:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2024-11-06 19:46:56,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:56,066 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, 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, 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, 2, 2, 2, 2, 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] [2024-11-06 19:46:56,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:46:56,066 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:56,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:56,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1824592865, now seen corresponding path program 1 times [2024-11-06 19:46:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:56,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433540258] [2024-11-06 19:46:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:56,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 409 trivial. 0 not checked. [2024-11-06 19:46:57,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:57,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433540258] [2024-11-06 19:46:57,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433540258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:57,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:57,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198658719] [2024-11-06 19:46:57,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:57,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:57,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:57,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:57,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:57,038 INFO L87 Difference]: Start difference. First operand 127674 states and 136083 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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:46:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:59,838 INFO L93 Difference]: Finished difference Result 264358 states and 281491 transitions. [2024-11-06 19:46:59,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:59,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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 680 [2024-11-06 19:46:59,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:59,967 INFO L225 Difference]: With dead ends: 264358 [2024-11-06 19:46:59,967 INFO L226 Difference]: Without dead ends: 136686 [2024-11-06 19:47:00,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:47:00,024 INFO L432 NwaCegarLoop]: 909 mSDtfsCounter, 653 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 2701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:00,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 917 Invalid, 2701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:47:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136686 states. [2024-11-06 19:47:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136686 to 128425. [2024-11-06 19:47:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128425 states, 128424 states have (on average 1.0632124836479162) internal successors, (136542), 128424 states have internal predecessors, (136542), 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:47:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128425 states to 128425 states and 136542 transitions. [2024-11-06 19:47:01,743 INFO L78 Accepts]: Start accepts. Automaton has 128425 states and 136542 transitions. Word has length 680 [2024-11-06 19:47:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:01,744 INFO L471 AbstractCegarLoop]: Abstraction has 128425 states and 136542 transitions. [2024-11-06 19:47:01,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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:47:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 128425 states and 136542 transitions. [2024-11-06 19:47:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1199 [2024-11-06 19:47:01,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:01,833 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:01,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:47:01,833 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:01,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:01,837 INFO L85 PathProgramCache]: Analyzing trace with hash -885098913, now seen corresponding path program 1 times [2024-11-06 19:47:01,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:01,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70520369] [2024-11-06 19:47:01,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:01,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 1096 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2024-11-06 19:47:02,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:02,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70520369] [2024-11-06 19:47:02,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70520369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:02,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:02,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:47:02,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740809200] [2024-11-06 19:47:02,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:02,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:47:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:02,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:47:02,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:02,619 INFO L87 Difference]: Start difference. First operand 128425 states and 136542 transitions. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 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:47:05,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:05,367 INFO L93 Difference]: Finished difference Result 283133 states and 302184 transitions. [2024-11-06 19:47:05,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:47:05,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 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 1198 [2024-11-06 19:47:05,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:05,541 INFO L225 Difference]: With dead ends: 283133 [2024-11-06 19:47:05,541 INFO L226 Difference]: Without dead ends: 155461 [2024-11-06 19:47:05,580 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:47:05,581 INFO L432 NwaCegarLoop]: 1280 mSDtfsCounter, 645 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2245 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 2245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:05,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1288 Invalid, 2564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 2245 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 19:47:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155461 states.