./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label20.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/Problem17_label20.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', 'f135ddf41791de61b2d6990344a7ec64104348ebc3877909c56fd71d04c40aca'] 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/Problem17_label20.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 f135ddf41791de61b2d6990344a7ec64104348ebc3877909c56fd71d04c40aca --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:05:37,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:05:37,933 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 20:05:37,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:05:37,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:05:37,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:05:37,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:05:37,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:05:37,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:05:37,966 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:05:37,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:05:37,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:05:37,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:05:37,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:05:37,968 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:05:37,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:05:37,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:05:37,968 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:05:37,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:05:37,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:05:37,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:05:37,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:05:37,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:05:37,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:05:37,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:05:37,969 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:05:37,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:05:37,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:05:37,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:05:37,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:05:37,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:05:37,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:05:37,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:05:37,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:05:37,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:05:37,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:05:37,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:05:37,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:05:37,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:05:37,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:05:37,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:05:37,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:05:37,970 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 -> f135ddf41791de61b2d6990344a7ec64104348ebc3877909c56fd71d04c40aca [2024-11-06 20:05:38,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:05:38,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:05:38,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:05:38,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:05:38,261 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:05:38,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label20.c [2024-11-06 20:05:39,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:05:39,986 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:05:39,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label20.c [2024-11-06 20:05:40,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3bc1bbe7b/fbfa973ddc8a4ba3a06b0b5a54a636c9/FLAG7b6d8f42f [2024-11-06 20:05:40,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3bc1bbe7b/fbfa973ddc8a4ba3a06b0b5a54a636c9 [2024-11-06 20:05:40,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:05:40,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:05:40,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:05:40,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:05:40,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:05:40,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:05:40" (1/1) ... [2024-11-06 20:05:40,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13084310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:40, skipping insertion in model container [2024-11-06 20:05:40,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:05:40" (1/1) ... [2024-11-06 20:05:40,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:05:40,313 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/Problem17_label20.c[4104,4117] [2024-11-06 20:05:40,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:05:40,846 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:05:40,862 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/Problem17_label20.c[4104,4117] [2024-11-06 20:05:41,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:05:41,121 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:05:41,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41 WrapperNode [2024-11-06 20:05:41,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:05:41,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:05:41,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:05:41,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:05:41,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41" (1/1) ... [2024-11-06 20:05:41,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41" (1/1) ... [2024-11-06 20:05:41,519 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-11-06 20:05:41,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:05:41,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:05:41,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:05:41,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:05:41,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41" (1/1) ... [2024-11-06 20:05:41,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41" (1/1) ... [2024-11-06 20:05:41,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41" (1/1) ... [2024-11-06 20:05:41,746 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 20:05:41,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41" (1/1) ... [2024-11-06 20:05:41,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41" (1/1) ... [2024-11-06 20:05:41,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41" (1/1) ... [2024-11-06 20:05:41,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41" (1/1) ... [2024-11-06 20:05:41,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41" (1/1) ... [2024-11-06 20:05:41,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41" (1/1) ... [2024-11-06 20:05:41,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:05:41,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:05:41,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:05:41,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:05:41,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41" (1/1) ... [2024-11-06 20:05:41,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:05:41,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:05:42,007 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 20:05:42,015 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 20:05:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:05:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:05:42,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:05:42,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:05:42,174 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:05:42,180 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:05:45,665 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-11-06 20:05:45,666 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:05:45,694 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:05:45,694 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:05:45,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:05:45 BoogieIcfgContainer [2024-11-06 20:05:45,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:05:45,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:05:45,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:05:45,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:05:45,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:05:40" (1/3) ... [2024-11-06 20:05:45,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4062e6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:05:45, skipping insertion in model container [2024-11-06 20:05:45,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:41" (2/3) ... [2024-11-06 20:05:45,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4062e6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:05:45, skipping insertion in model container [2024-11-06 20:05:45,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:05:45" (3/3) ... [2024-11-06 20:05:45,706 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label20.c [2024-11-06 20:05:45,721 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:05:45,722 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:05:45,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:05:45,809 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;@259a585d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:05:45,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:05:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 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 20:05:45,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-06 20:05:45,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:45,824 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] [2024-11-06 20:05:45,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:45,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:45,829 INFO L85 PathProgramCache]: Analyzing trace with hash 678582746, now seen corresponding path program 1 times [2024-11-06 20:05:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:45,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30315191] [2024-11-06 20:05:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:45,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:46,113 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 20:05:46,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:46,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30315191] [2024-11-06 20:05:46,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30315191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:46,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:46,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:05:46,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57258893] [2024-11-06 20:05:46,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:46,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:46,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:46,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:46,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:46,143 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 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 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 20:05:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:48,487 INFO L93 Difference]: Finished difference Result 1644 states and 3029 transitions. [2024-11-06 20:05:48,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:48,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 26 [2024-11-06 20:05:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:48,502 INFO L225 Difference]: With dead ends: 1644 [2024-11-06 20:05:48,502 INFO L226 Difference]: Without dead ends: 977 [2024-11-06 20:05:48,506 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 20:05:48,508 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 462 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:48,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 20:05:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-06 20:05:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2024-11-06 20:05:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 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 20:05:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2024-11-06 20:05:48,576 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 26 [2024-11-06 20:05:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:48,577 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2024-11-06 20:05:48,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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 20:05:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2024-11-06 20:05:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-06 20:05:48,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:48,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:48,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:05:48,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:48,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1184188270, now seen corresponding path program 1 times [2024-11-06 20:05:48,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:48,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639433520] [2024-11-06 20:05:48,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:48,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:05:48,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:48,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639433520] [2024-11-06 20:05:48,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639433520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:48,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:48,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:05:48,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049971924] [2024-11-06 20:05:48,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:48,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:48,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:48,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:48,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:48,872 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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 20:05:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:50,922 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2024-11-06 20:05:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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 93 [2024-11-06 20:05:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:50,930 INFO L225 Difference]: With dead ends: 2813 [2024-11-06 20:05:50,930 INFO L226 Difference]: Without dead ends: 1844 [2024-11-06 20:05:50,932 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 20:05:50,934 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:50,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 579 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 20:05:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2024-11-06 20:05:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2024-11-06 20:05:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 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 20:05:50,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2024-11-06 20:05:50,980 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 93 [2024-11-06 20:05:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:50,981 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2024-11-06 20:05:50,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 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 20:05:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2024-11-06 20:05:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-06 20:05:50,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:50,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:50,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:05:50,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:50,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2118783002, now seen corresponding path program 1 times [2024-11-06 20:05:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:50,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054393347] [2024-11-06 20:05:50,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:05:51,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:51,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054393347] [2024-11-06 20:05:51,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054393347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:51,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:51,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:51,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54282494] [2024-11-06 20:05:51,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:51,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:51,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:51,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:51,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:51,251 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 20:05:53,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:53,213 INFO L93 Difference]: Finished difference Result 4552 states and 6282 transitions. [2024-11-06 20:05:53,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:53,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2024-11-06 20:05:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:53,224 INFO L225 Difference]: With dead ends: 4552 [2024-11-06 20:05:53,224 INFO L226 Difference]: Without dead ends: 2713 [2024-11-06 20:05:53,227 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 20:05:53,228 INFO L432 NwaCegarLoop]: 818 mSDtfsCounter, 481 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:53,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 886 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 20:05:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2024-11-06 20:05:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2711. [2024-11-06 20:05:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2711 states, 2710 states have (on average 1.3003690036900368) internal successors, (3524), 2710 states have internal predecessors, (3524), 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 20:05:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2711 states and 3524 transitions. [2024-11-06 20:05:53,276 INFO L78 Accepts]: Start accepts. Automaton has 2711 states and 3524 transitions. Word has length 96 [2024-11-06 20:05:53,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:53,277 INFO L471 AbstractCegarLoop]: Abstraction has 2711 states and 3524 transitions. [2024-11-06 20:05:53,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 20:05:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2711 states and 3524 transitions. [2024-11-06 20:05:53,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-06 20:05:53,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:53,280 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:05:53,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:05:53,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:53,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1216215233, now seen corresponding path program 1 times [2024-11-06 20:05:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323221680] [2024-11-06 20:05:53,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-06 20:05:53,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:53,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323221680] [2024-11-06 20:05:53,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323221680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:53,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:05:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856154933] [2024-11-06 20:05:53,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:53,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:53,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:53,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:53,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:53,683 INFO L87 Difference]: Start difference. First operand 2711 states and 3524 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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 20:05:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:55,326 INFO L93 Difference]: Finished difference Result 7984 states and 10361 transitions. [2024-11-06 20:05:55,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:55,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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 165 [2024-11-06 20:05:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:55,340 INFO L225 Difference]: With dead ends: 7984 [2024-11-06 20:05:55,340 INFO L226 Difference]: Without dead ends: 4421 [2024-11-06 20:05:55,343 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 20:05:55,346 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:55,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 591 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:05:55,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2024-11-06 20:05:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3571. [2024-11-06 20:05:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 3570 states have (on average 1.1775910364145659) internal successors, (4204), 3570 states have internal predecessors, (4204), 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 20:05:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 4204 transitions. [2024-11-06 20:05:55,407 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 4204 transitions. Word has length 165 [2024-11-06 20:05:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:55,408 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 4204 transitions. [2024-11-06 20:05:55,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 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 20:05:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 4204 transitions. [2024-11-06 20:05:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-06 20:05:55,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:55,411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:05:55,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 20:05:55,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:55,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1971056701, now seen corresponding path program 1 times [2024-11-06 20:05:55,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:55,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752886917] [2024-11-06 20:05:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:05:55,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:55,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752886917] [2024-11-06 20:05:55,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752886917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:55,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:55,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:55,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117108118] [2024-11-06 20:05:55,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:55,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:55,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:55,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:55,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:55,649 INFO L87 Difference]: Start difference. First operand 3571 states and 4204 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 20:05:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:57,180 INFO L93 Difference]: Finished difference Result 9273 states and 11087 transitions. [2024-11-06 20:05:57,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:57,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 178 [2024-11-06 20:05:57,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:57,195 INFO L225 Difference]: With dead ends: 9273 [2024-11-06 20:05:57,196 INFO L226 Difference]: Without dead ends: 5704 [2024-11-06 20:05:57,200 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 20:05:57,201 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:57,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:05:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2024-11-06 20:05:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 5704. [2024-11-06 20:05:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5704 states, 5703 states have (on average 1.1595651411537786) internal successors, (6613), 5703 states have internal predecessors, (6613), 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 20:05:57,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 6613 transitions. [2024-11-06 20:05:57,283 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 6613 transitions. Word has length 178 [2024-11-06 20:05:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:57,284 INFO L471 AbstractCegarLoop]: Abstraction has 5704 states and 6613 transitions. [2024-11-06 20:05:57,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 20:05:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 6613 transitions. [2024-11-06 20:05:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-06 20:05:57,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:57,286 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:05:57,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:05:57,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:57,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash -519493896, now seen corresponding path program 1 times [2024-11-06 20:05:57,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:57,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889497715] [2024-11-06 20:05:57,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:57,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 20:05:57,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:57,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889497715] [2024-11-06 20:05:57,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889497715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:57,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:57,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:57,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466504064] [2024-11-06 20:05:57,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:57,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:57,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:57,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:57,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:57,556 INFO L87 Difference]: Start difference. First operand 5704 states and 6613 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 20:05:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:59,184 INFO L93 Difference]: Finished difference Result 14376 states and 16776 transitions. [2024-11-06 20:05:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 180 [2024-11-06 20:05:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:59,202 INFO L225 Difference]: With dead ends: 14376 [2024-11-06 20:05:59,202 INFO L226 Difference]: Without dead ends: 8673 [2024-11-06 20:05:59,206 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 20:05:59,207 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 425 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:59,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:05:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8673 states. [2024-11-06 20:05:59,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8673 to 5677. [2024-11-06 20:05:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5677 states, 5676 states have (on average 1.1578576462297392) internal successors, (6572), 5676 states have internal predecessors, (6572), 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 20:05:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 6572 transitions. [2024-11-06 20:05:59,303 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 6572 transitions. Word has length 180 [2024-11-06 20:05:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:59,304 INFO L471 AbstractCegarLoop]: Abstraction has 5677 states and 6572 transitions. [2024-11-06 20:05:59,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 20:05:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 6572 transitions. [2024-11-06 20:05:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-06 20:05:59,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:59,307 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:05:59,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 20:05:59,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:59,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:59,309 INFO L85 PathProgramCache]: Analyzing trace with hash 480615035, now seen corresponding path program 1 times [2024-11-06 20:05:59,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:59,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228265907] [2024-11-06 20:05:59,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:59,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-06 20:05:59,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:59,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228265907] [2024-11-06 20:05:59,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228265907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:59,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:59,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:59,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548832527] [2024-11-06 20:05:59,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:59,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:59,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:59,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:59,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:59,492 INFO L87 Difference]: Start difference. First operand 5677 states and 6572 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 20:06:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:00,998 INFO L93 Difference]: Finished difference Result 14315 states and 16680 transitions. [2024-11-06 20:06:00,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:00,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 258 [2024-11-06 20:06:00,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:01,016 INFO L225 Difference]: With dead ends: 14315 [2024-11-06 20:06:01,016 INFO L226 Difference]: Without dead ends: 7790 [2024-11-06 20:06:01,021 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 20:06:01,021 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 383 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:01,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 847 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:06:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7790 states. [2024-11-06 20:06:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7790 to 7790. [2024-11-06 20:06:01,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7790 states, 7789 states have (on average 1.1186288355372962) internal successors, (8713), 7789 states have internal predecessors, (8713), 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 20:06:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 8713 transitions. [2024-11-06 20:06:01,125 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 8713 transitions. Word has length 258 [2024-11-06 20:06:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:01,125 INFO L471 AbstractCegarLoop]: Abstraction has 7790 states and 8713 transitions. [2024-11-06 20:06:01,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 20:06:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 8713 transitions. [2024-11-06 20:06:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-11-06 20:06:01,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:01,130 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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 20:06:01,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 20:06:01,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:01,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:01,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1362962210, now seen corresponding path program 1 times [2024-11-06 20:06:01,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:01,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946938768] [2024-11-06 20:06:01,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-06 20:06:01,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:01,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946938768] [2024-11-06 20:06:01,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946938768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:01,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:01,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:01,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307390964] [2024-11-06 20:06:01,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:01,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:01,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:01,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:01,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:01,504 INFO L87 Difference]: Start difference. First operand 7790 states and 8713 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 20:06:03,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:03,035 INFO L93 Difference]: Finished difference Result 18559 states and 20913 transitions. [2024-11-06 20:06:03,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:03,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 298 [2024-11-06 20:06:03,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:03,054 INFO L225 Difference]: With dead ends: 18559 [2024-11-06 20:06:03,054 INFO L226 Difference]: Without dead ends: 10771 [2024-11-06 20:06:03,059 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 20:06:03,059 INFO L432 NwaCegarLoop]: 347 mSDtfsCounter, 446 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:03,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 402 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:06:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10771 states. [2024-11-06 20:06:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10771 to 9916. [2024-11-06 20:06:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9916 states, 9915 states have (on average 1.119415027735754) internal successors, (11099), 9915 states have internal predecessors, (11099), 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 20:06:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9916 states to 9916 states and 11099 transitions. [2024-11-06 20:06:03,163 INFO L78 Accepts]: Start accepts. Automaton has 9916 states and 11099 transitions. Word has length 298 [2024-11-06 20:06:03,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:03,164 INFO L471 AbstractCegarLoop]: Abstraction has 9916 states and 11099 transitions. [2024-11-06 20:06:03,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 20:06:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 9916 states and 11099 transitions. [2024-11-06 20:06:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-06 20:06:03,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:03,171 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:03,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 20:06:03,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:03,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash -45149776, now seen corresponding path program 1 times [2024-11-06 20:06:03,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:03,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923761296] [2024-11-06 20:06:03,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:06:03,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:03,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923761296] [2024-11-06 20:06:03,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923761296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:03,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:03,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:03,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041710645] [2024-11-06 20:06:03,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:03,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:06:03,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:03,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:06:03,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:06:03,555 INFO L87 Difference]: Start difference. First operand 9916 states and 11099 transitions. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 3 states have internal predecessors, (365), 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 20:06:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:05,782 INFO L93 Difference]: Finished difference Result 26239 states and 29414 transitions. [2024-11-06 20:06:05,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:06:05,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 3 states have internal predecessors, (365), 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 365 [2024-11-06 20:06:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:05,818 INFO L225 Difference]: With dead ends: 26239 [2024-11-06 20:06:05,818 INFO L226 Difference]: Without dead ends: 15900 [2024-11-06 20:06:05,829 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 20:06:05,830 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 649 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 2697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:05,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 197 Invalid, 2697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 20:06:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15900 states. [2024-11-06 20:06:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15900 to 15898. [2024-11-06 20:06:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15898 states, 15897 states have (on average 1.1247405170786942) internal successors, (17880), 15897 states have internal predecessors, (17880), 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 20:06:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15898 states to 15898 states and 17880 transitions. [2024-11-06 20:06:06,046 INFO L78 Accepts]: Start accepts. Automaton has 15898 states and 17880 transitions. Word has length 365 [2024-11-06 20:06:06,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:06,047 INFO L471 AbstractCegarLoop]: Abstraction has 15898 states and 17880 transitions. [2024-11-06 20:06:06,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 3 states have internal predecessors, (365), 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 20:06:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 15898 states and 17880 transitions. [2024-11-06 20:06:06,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-11-06 20:06:06,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:06,059 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:06,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 20:06:06,060 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:06,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:06,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1778342367, now seen corresponding path program 1 times [2024-11-06 20:06:06,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:06,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556462116] [2024-11-06 20:06:06,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:06,303 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-06 20:06:06,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:06,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556462116] [2024-11-06 20:06:06,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556462116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:06,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:06,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:06,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761904384] [2024-11-06 20:06:06,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:06,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:06,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:06,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:06,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:06,306 INFO L87 Difference]: Start difference. First operand 15898 states and 17880 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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 20:06:08,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:08,053 INFO L93 Difference]: Finished difference Result 44148 states and 49784 transitions. [2024-11-06 20:06:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:08,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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 399 [2024-11-06 20:06:08,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:08,113 INFO L225 Difference]: With dead ends: 44148 [2024-11-06 20:06:08,114 INFO L226 Difference]: Without dead ends: 28252 [2024-11-06 20:06:08,129 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 20:06:08,133 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 497 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:08,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 287 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:06:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28252 states. [2024-11-06 20:06:08,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28252 to 27809. [2024-11-06 20:06:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27809 states, 27808 states have (on average 1.1171605293440736) internal successors, (31066), 27808 states have internal predecessors, (31066), 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 20:06:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27809 states to 27809 states and 31066 transitions. [2024-11-06 20:06:08,533 INFO L78 Accepts]: Start accepts. Automaton has 27809 states and 31066 transitions. Word has length 399 [2024-11-06 20:06:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:08,534 INFO L471 AbstractCegarLoop]: Abstraction has 27809 states and 31066 transitions. [2024-11-06 20:06:08,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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 20:06:08,534 INFO L276 IsEmpty]: Start isEmpty. Operand 27809 states and 31066 transitions. [2024-11-06 20:06:08,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2024-11-06 20:06:08,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:08,545 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:06:08,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 20:06:08,546 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:08,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:08,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2027700145, now seen corresponding path program 1 times [2024-11-06 20:06:08,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:08,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003839400] [2024-11-06 20:06:08,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:08,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 47 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:06:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:10,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003839400] [2024-11-06 20:06:10,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003839400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:06:10,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578717450] [2024-11-06 20:06:10,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:10,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:06:10,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:06:10,392 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 20:06:10,394 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 20:06:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:10,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 20:06:10,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:06:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 47 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:06:11,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:06:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:06:11,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578717450] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 20:06:11,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 20:06:11,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 3] total 10 [2024-11-06 20:06:11,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174341049] [2024-11-06 20:06:11,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:11,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:06:11,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:11,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:06:11,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-06 20:06:11,759 INFO L87 Difference]: Start difference. First operand 27809 states and 31066 transitions. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 3 states have internal predecessors, (412), 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 20:06:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:14,595 INFO L93 Difference]: Finished difference Result 83735 states and 93626 transitions. [2024-11-06 20:06:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:06:14,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 3 states have internal predecessors, (412), 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 412 [2024-11-06 20:06:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:14,668 INFO L225 Difference]: With dead ends: 83735 [2024-11-06 20:06:14,669 INFO L226 Difference]: Without dead ends: 55075 [2024-11-06 20:06:14,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 819 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-06 20:06:14,697 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 711 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 3130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 803 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:14,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 171 Invalid, 3130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [803 Valid, 2327 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 20:06:14,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55075 states. [2024-11-06 20:06:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55075 to 51237. [2024-11-06 20:06:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51237 states, 51236 states have (on average 1.1068389413693496) internal successors, (56710), 51236 states have internal predecessors, (56710), 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 20:06:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51237 states to 51237 states and 56710 transitions. [2024-11-06 20:06:15,550 INFO L78 Accepts]: Start accepts. Automaton has 51237 states and 56710 transitions. Word has length 412 [2024-11-06 20:06:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:15,551 INFO L471 AbstractCegarLoop]: Abstraction has 51237 states and 56710 transitions. [2024-11-06 20:06:15,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 3 states have internal predecessors, (412), 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 20:06:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 51237 states and 56710 transitions. [2024-11-06 20:06:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2024-11-06 20:06:15,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:15,564 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:15,584 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 20:06:15,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-06 20:06:15,765 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:15,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1716785727, now seen corresponding path program 1 times [2024-11-06 20:06:15,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:15,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838245812] [2024-11-06 20:06:15,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:06:16,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:16,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838245812] [2024-11-06 20:06:16,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838245812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:16,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:16,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:06:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640929681] [2024-11-06 20:06:16,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:16,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:06:16,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:16,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:06:16,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:06:16,579 INFO L87 Difference]: Start difference. First operand 51237 states and 56710 transitions. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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 20:06:19,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:19,050 INFO L93 Difference]: Finished difference Result 119501 states and 132258 transitions. [2024-11-06 20:06:19,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:06:19,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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 461 [2024-11-06 20:06:19,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:19,146 INFO L225 Difference]: With dead ends: 119501 [2024-11-06 20:06:19,147 INFO L226 Difference]: Without dead ends: 68266 [2024-11-06 20:06:19,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 20:06:19,201 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 914 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:19,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 318 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 1867 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 20:06:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68266 states. [2024-11-06 20:06:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68266 to 61447. [2024-11-06 20:06:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61447 states, 61446 states have (on average 1.1070858965595807) internal successors, (68026), 61446 states have internal predecessors, (68026), 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 20:06:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61447 states to 61447 states and 68026 transitions. [2024-11-06 20:06:20,008 INFO L78 Accepts]: Start accepts. Automaton has 61447 states and 68026 transitions. Word has length 461 [2024-11-06 20:06:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:20,010 INFO L471 AbstractCegarLoop]: Abstraction has 61447 states and 68026 transitions. [2024-11-06 20:06:20,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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 20:06:20,010 INFO L276 IsEmpty]: Start isEmpty. Operand 61447 states and 68026 transitions. [2024-11-06 20:06:20,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2024-11-06 20:06:20,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:20,022 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:20,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 20:06:20,022 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:20,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:20,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2055513357, now seen corresponding path program 1 times [2024-11-06 20:06:20,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:20,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456806775] [2024-11-06 20:06:20,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:20,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-06 20:06:20,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:20,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456806775] [2024-11-06 20:06:20,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456806775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:20,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:20,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:20,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349055884] [2024-11-06 20:06:20,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:20,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:20,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:20,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:20,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:20,222 INFO L87 Difference]: Start difference. First operand 61447 states and 68026 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 20:06:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:22,013 INFO L93 Difference]: Finished difference Result 120334 states and 133047 transitions. [2024-11-06 20:06:22,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:22,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 469 [2024-11-06 20:06:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:22,073 INFO L225 Difference]: With dead ends: 120334 [2024-11-06 20:06:22,073 INFO L226 Difference]: Without dead ends: 58889 [2024-11-06 20:06:22,106 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 20:06:22,107 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 469 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:22,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 321 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:06:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58889 states. [2024-11-06 20:06:22,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58889 to 54633. [2024-11-06 20:06:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54633 states, 54632 states have (on average 1.1071533167374432) internal successors, (60486), 54632 states have internal predecessors, (60486), 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 20:06:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54633 states to 54633 states and 60486 transitions. [2024-11-06 20:06:22,867 INFO L78 Accepts]: Start accepts. Automaton has 54633 states and 60486 transitions. Word has length 469 [2024-11-06 20:06:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:22,869 INFO L471 AbstractCegarLoop]: Abstraction has 54633 states and 60486 transitions. [2024-11-06 20:06:22,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 20:06:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 54633 states and 60486 transitions. [2024-11-06 20:06:22,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2024-11-06 20:06:22,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:22,882 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:22,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 20:06:22,882 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:22,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:22,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1902470575, now seen corresponding path program 1 times [2024-11-06 20:06:22,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:22,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167875880] [2024-11-06 20:06:22,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:22,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-06 20:06:23,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:23,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167875880] [2024-11-06 20:06:23,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167875880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:23,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:23,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:23,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405739405] [2024-11-06 20:06:23,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:23,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:23,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:23,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:23,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:23,605 INFO L87 Difference]: Start difference. First operand 54633 states and 60486 transitions. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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 20:06:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:25,094 INFO L93 Difference]: Finished difference Result 110542 states and 122307 transitions. [2024-11-06 20:06:25,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:25,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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 486 [2024-11-06 20:06:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:25,158 INFO L225 Difference]: With dead ends: 110542 [2024-11-06 20:06:25,158 INFO L226 Difference]: Without dead ends: 55911 [2024-11-06 20:06:25,191 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 20:06:25,192 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 127 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:25,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 839 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:06:25,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55911 states. [2024-11-06 20:06:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55911 to 55909. [2024-11-06 20:06:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55909 states, 55908 states have (on average 1.1046540745510482) internal successors, (61759), 55908 states have internal predecessors, (61759), 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 20:06:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55909 states to 55909 states and 61759 transitions. [2024-11-06 20:06:25,785 INFO L78 Accepts]: Start accepts. Automaton has 55909 states and 61759 transitions. Word has length 486 [2024-11-06 20:06:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:25,785 INFO L471 AbstractCegarLoop]: Abstraction has 55909 states and 61759 transitions. [2024-11-06 20:06:25,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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 20:06:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 55909 states and 61759 transitions. [2024-11-06 20:06:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-11-06 20:06:25,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:25,796 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:25,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 20:06:25,796 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:25,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash 839929655, now seen corresponding path program 1 times [2024-11-06 20:06:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:25,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556036795] [2024-11-06 20:06:25,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:25,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 208 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 20:06:26,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:26,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556036795] [2024-11-06 20:06:26,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556036795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:06:26,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010373535] [2024-11-06 20:06:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:26,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:06:26,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:06:26,340 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 20:06:26,344 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 20:06:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:26,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 20:06:26,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:06:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 208 proven. 78 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 20:06:26,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:06:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 20:06:27,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010373535] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 20:06:27,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 20:06:27,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-11-06 20:06:27,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728559559] [2024-11-06 20:06:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:27,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:06:27,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:27,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:06:27,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:06:27,023 INFO L87 Difference]: Start difference. First operand 55909 states and 61759 transitions. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 3 states have internal predecessors, (468), 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 20:06:29,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:29,381 INFO L93 Difference]: Finished difference Result 126723 states and 139743 transitions. [2024-11-06 20:06:29,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:06:29,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 3 states have internal predecessors, (468), 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 491 [2024-11-06 20:06:29,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:29,447 INFO L225 Difference]: With dead ends: 126723 [2024-11-06 20:06:29,447 INFO L226 Difference]: Without dead ends: 70388 [2024-11-06 20:06:29,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 983 GetRequests, 979 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:06:29,482 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 843 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 2757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:29,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 202 Invalid, 2757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 20:06:29,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70388 states. [2024-11-06 20:06:30,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70388 to 63586. [2024-11-06 20:06:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63586 states, 63585 states have (on average 1.1042069670519776) internal successors, (70211), 63585 states have internal predecessors, (70211), 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 20:06:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63586 states to 63586 states and 70211 transitions. [2024-11-06 20:06:30,376 INFO L78 Accepts]: Start accepts. Automaton has 63586 states and 70211 transitions. Word has length 491 [2024-11-06 20:06:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:30,376 INFO L471 AbstractCegarLoop]: Abstraction has 63586 states and 70211 transitions. [2024-11-06 20:06:30,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 3 states have internal predecessors, (468), 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 20:06:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 63586 states and 70211 transitions. [2024-11-06 20:06:30,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2024-11-06 20:06:30,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:30,389 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:30,402 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 20:06:30,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-06 20:06:30,590 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:30,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:30,591 INFO L85 PathProgramCache]: Analyzing trace with hash -775908129, now seen corresponding path program 1 times [2024-11-06 20:06:30,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:30,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895325767] [2024-11-06 20:06:30,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:30,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 234 proven. 82 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 20:06:31,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:31,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895325767] [2024-11-06 20:06:31,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895325767] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:06:31,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419738228] [2024-11-06 20:06:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:31,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:06:31,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:06:31,571 INFO L229 MonitoredProcess]: Starting monitored process 4 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 20:06:31,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 20:06:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:31,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 20:06:31,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:06:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 234 proven. 82 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 20:06:32,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:06:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 234 proven. 82 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 20:06:32,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419738228] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 20:06:32,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 20:06:32,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-06 20:06:32,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678133538] [2024-11-06 20:06:32,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 20:06:32,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 20:06:32,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:32,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 20:06:32,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-06 20:06:32,986 INFO L87 Difference]: Start difference. First operand 63586 states and 70211 transitions. Second operand has 8 states, 8 states have (on average 109.0) internal successors, (872), 7 states have internal predecessors, (872), 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 20:06:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:39,580 INFO L93 Difference]: Finished difference Result 177438 states and 194996 transitions. [2024-11-06 20:06:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 20:06:39,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 109.0) internal successors, (872), 7 states have internal predecessors, (872), 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 517 [2024-11-06 20:06:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:39,692 INFO L225 Difference]: With dead ends: 177438 [2024-11-06 20:06:39,692 INFO L226 Difference]: Without dead ends: 111729 [2024-11-06 20:06:39,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1040 GetRequests, 1029 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-06 20:06:39,716 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 6881 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 7451 mSolverCounterSat, 1053 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6881 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 8504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1053 IncrementalHoareTripleChecker+Valid, 7451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:39,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6881 Valid, 427 Invalid, 8504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1053 Valid, 7451 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-06 20:06:39,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111729 states. [2024-11-06 20:06:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111729 to 107881. [2024-11-06 20:06:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107881 states, 107880 states have (on average 1.088626251390434) internal successors, (117441), 107880 states have internal predecessors, (117441), 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 20:06:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107881 states to 107881 states and 117441 transitions. [2024-11-06 20:06:40,745 INFO L78 Accepts]: Start accepts. Automaton has 107881 states and 117441 transitions. Word has length 517 [2024-11-06 20:06:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:40,745 INFO L471 AbstractCegarLoop]: Abstraction has 107881 states and 117441 transitions. [2024-11-06 20:06:40,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.0) internal successors, (872), 7 states have internal predecessors, (872), 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 20:06:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 107881 states and 117441 transitions. [2024-11-06 20:06:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2024-11-06 20:06:40,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:40,756 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-06 20:06:40,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-06 20:06:40,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:06:40,957 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:40,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:40,957 INFO L85 PathProgramCache]: Analyzing trace with hash 120649426, now seen corresponding path program 1 times [2024-11-06 20:06:40,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:40,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901312192] [2024-11-06 20:06:40,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:40,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 497 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-06 20:06:41,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:41,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901312192] [2024-11-06 20:06:41,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901312192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:41,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:41,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:41,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916919984] [2024-11-06 20:06:41,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:41,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:41,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:41,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:41,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:41,615 INFO L87 Difference]: Start difference. First operand 107881 states and 117441 transitions. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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 20:06:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:43,530 INFO L93 Difference]: Finished difference Result 234034 states and 254087 transitions. [2024-11-06 20:06:43,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:43,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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 592 [2024-11-06 20:06:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:43,665 INFO L225 Difference]: With dead ends: 234034 [2024-11-06 20:06:43,665 INFO L226 Difference]: Without dead ends: 119767 [2024-11-06 20:06:43,735 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 20:06:43,735 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 446 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:43,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 566 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:06:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119767 states. [2024-11-06 20:06:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119767 to 111237. [2024-11-06 20:06:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111237 states, 111236 states have (on average 1.0776367363083894) internal successors, (119872), 111236 states have internal predecessors, (119872), 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 20:06:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111237 states to 111237 states and 119872 transitions. [2024-11-06 20:06:45,354 INFO L78 Accepts]: Start accepts. Automaton has 111237 states and 119872 transitions. Word has length 592 [2024-11-06 20:06:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:45,354 INFO L471 AbstractCegarLoop]: Abstraction has 111237 states and 119872 transitions. [2024-11-06 20:06:45,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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 20:06:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 111237 states and 119872 transitions. [2024-11-06 20:06:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2024-11-06 20:06:45,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:45,362 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:45,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 20:06:45,362 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:45,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash 393189501, now seen corresponding path program 1 times [2024-11-06 20:06:45,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:45,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588709435] [2024-11-06 20:06:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:45,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-06 20:06:46,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:46,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588709435] [2024-11-06 20:06:46,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588709435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:46,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:46,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:46,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566711918] [2024-11-06 20:06:46,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:46,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:46,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:46,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:46,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:46,474 INFO L87 Difference]: Start difference. First operand 111237 states and 119872 transitions. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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 20:06:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:47,869 INFO L93 Difference]: Finished difference Result 222045 states and 239313 transitions. [2024-11-06 20:06:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:47,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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 593 [2024-11-06 20:06:47,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:47,994 INFO L225 Difference]: With dead ends: 222045 [2024-11-06 20:06:47,994 INFO L226 Difference]: Without dead ends: 111235 [2024-11-06 20:06:48,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 20:06:48,062 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 583 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:48,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 538 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 20:06:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111235 states. [2024-11-06 20:06:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111235 to 111234. [2024-11-06 20:06:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111234 states, 111233 states have (on average 1.0775219584116225) internal successors, (119856), 111233 states have internal predecessors, (119856), 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 20:06:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111234 states to 111234 states and 119856 transitions. [2024-11-06 20:06:49,339 INFO L78 Accepts]: Start accepts. Automaton has 111234 states and 119856 transitions. Word has length 593 [2024-11-06 20:06:49,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:49,339 INFO L471 AbstractCegarLoop]: Abstraction has 111234 states and 119856 transitions. [2024-11-06 20:06:49,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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 20:06:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 111234 states and 119856 transitions. [2024-11-06 20:06:49,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2024-11-06 20:06:49,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:49,349 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:06:49,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 20:06:49,349 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:49,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:49,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1659681349, now seen corresponding path program 1 times [2024-11-06 20:06:49,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:49,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262341096] [2024-11-06 20:06:49,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:49,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-06 20:06:49,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:49,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262341096] [2024-11-06 20:06:49,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262341096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:49,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:49,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:49,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511023885] [2024-11-06 20:06:49,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:49,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:49,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:49,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:49,877 INFO L87 Difference]: Start difference. First operand 111234 states and 119856 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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 20:06:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:51,883 INFO L93 Difference]: Finished difference Result 223321 states and 240657 transitions. [2024-11-06 20:06:51,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:51,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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 612 [2024-11-06 20:06:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:52,008 INFO L225 Difference]: With dead ends: 223321 [2024-11-06 20:06:52,008 INFO L226 Difference]: Without dead ends: 112514 [2024-11-06 20:06:52,042 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 20:06:52,043 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 502 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:52,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 631 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:06:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112514 states. [2024-11-06 20:06:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112514 to 112084. [2024-11-06 20:06:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112084 states, 112083 states have (on average 1.071714711419216) internal successors, (120121), 112083 states have internal predecessors, (120121), 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 20:06:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112084 states to 112084 states and 120121 transitions. [2024-11-06 20:06:53,173 INFO L78 Accepts]: Start accepts. Automaton has 112084 states and 120121 transitions. Word has length 612 [2024-11-06 20:06:53,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:53,173 INFO L471 AbstractCegarLoop]: Abstraction has 112084 states and 120121 transitions. [2024-11-06 20:06:53,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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 20:06:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 112084 states and 120121 transitions. [2024-11-06 20:06:53,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2024-11-06 20:06:53,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:53,183 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:06:53,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 20:06:53,183 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:53,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:53,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1255899471, now seen corresponding path program 1 times [2024-11-06 20:06:53,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:53,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764028641] [2024-11-06 20:06:53,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:53,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 537 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-06 20:06:53,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:53,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764028641] [2024-11-06 20:06:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764028641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:53,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:53,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:53,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473558847] [2024-11-06 20:06:53,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:53,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:53,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:53,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:53,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:53,822 INFO L87 Difference]: Start difference. First operand 112084 states and 120121 transitions. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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)