./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label41.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/Problem11_label41.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', 'fbec2ea101c707e702b17d0034cae7e7b8797fb6283b52539a46012e389affe6'] 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/Problem11_label41.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 fbec2ea101c707e702b17d0034cae7e7b8797fb6283b52539a46012e389affe6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:39:18,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:39:18,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:39:18,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:39:18,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:39:18,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:39:18,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:39:18,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:39:18,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:39:18,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:39:18,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:39:18,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:39:18,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:39:18,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:39:18,137 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:39:18,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:39:18,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:39:18,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:39:18,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:39:18,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:39:18,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:39:18,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:39:18,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:39:18,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:39:18,138 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:39:18,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:39:18,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:39:18,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:39:18,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:39:18,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:39:18,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:39:18,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:39:18,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:39:18,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:39:18,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:39:18,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:39:18,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:39:18,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:39:18,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:39:18,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:39:18,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:39:18,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:39:18,139 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 -> fbec2ea101c707e702b17d0034cae7e7b8797fb6283b52539a46012e389affe6 [2024-11-06 19:39:18,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:39:18,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:39:18,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:39:18,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:39:18,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:39:18,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label41.c [2024-11-06 19:39:19,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:39:19,995 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:39:19,995 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label41.c [2024-11-06 19:39:20,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cc117cb7/6718010c342e4ec8ae15d31d8b74cc75/FLAGaa93621a7 [2024-11-06 19:39:20,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cc117cb7/6718010c342e4ec8ae15d31d8b74cc75 [2024-11-06 19:39:20,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:39:20,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:39:20,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:39:20,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:39:20,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:39:20,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:39:20" (1/1) ... [2024-11-06 19:39:20,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fb94e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:20, skipping insertion in model container [2024-11-06 19:39:20,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:39:20" (1/1) ... [2024-11-06 19:39:20,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:39:20,478 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/Problem11_label41.c[3129,3142] [2024-11-06 19:39:20,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:39:20,874 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:39:20,900 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/Problem11_label41.c[3129,3142] [2024-11-06 19:39:21,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:39:21,092 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:39:21,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21 WrapperNode [2024-11-06 19:39:21,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:39:21,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:39:21,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:39:21,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:39:21,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21" (1/1) ... [2024-11-06 19:39:21,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21" (1/1) ... [2024-11-06 19:39:21,220 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-06 19:39:21,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:39:21,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:39:21,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:39:21,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:39:21,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21" (1/1) ... [2024-11-06 19:39:21,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21" (1/1) ... [2024-11-06 19:39:21,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21" (1/1) ... [2024-11-06 19:39:21,263 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 19:39:21,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21" (1/1) ... [2024-11-06 19:39:21,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21" (1/1) ... [2024-11-06 19:39:21,289 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21" (1/1) ... [2024-11-06 19:39:21,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21" (1/1) ... [2024-11-06 19:39:21,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21" (1/1) ... [2024-11-06 19:39:21,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21" (1/1) ... [2024-11-06 19:39:21,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:39:21,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:39:21,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:39:21,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:39:21,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21" (1/1) ... [2024-11-06 19:39:21,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:39:21,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:39:21,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 19:39:21,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 19:39:21,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:39:21,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:39:21,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:39:21,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:39:21,415 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:39:21,416 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:39:22,815 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-06 19:39:22,815 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:39:22,825 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:39:22,825 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:39:22,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:22 BoogieIcfgContainer [2024-11-06 19:39:22,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:39:22,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:39:22,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:39:22,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:39:22,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:39:20" (1/3) ... [2024-11-06 19:39:22,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a11ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:39:22, skipping insertion in model container [2024-11-06 19:39:22,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:39:21" (2/3) ... [2024-11-06 19:39:22,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a11ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:39:22, skipping insertion in model container [2024-11-06 19:39:22,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:22" (3/3) ... [2024-11-06 19:39:22,832 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label41.c [2024-11-06 19:39:22,841 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:39:22,841 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:39:22,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:39:22,903 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;@2b215de6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:39:22,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:39:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-06 19:39:22,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:22,911 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] [2024-11-06 19:39:22,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:22,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash -85512855, now seen corresponding path program 1 times [2024-11-06 19:39:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:22,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072215594] [2024-11-06 19:39:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:22,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:23,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:23,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072215594] [2024-11-06 19:39:23,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072215594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:23,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:23,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049402483] [2024-11-06 19:39:23,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:23,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:23,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:23,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:23,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:23,144 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:23,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:23,993 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2024-11-06 19:39:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:23,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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 21 [2024-11-06 19:39:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:24,002 INFO L225 Difference]: With dead ends: 761 [2024-11-06 19:39:24,005 INFO L226 Difference]: Without dead ends: 413 [2024-11-06 19:39:24,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:24,011 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 207 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:24,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:39:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-06 19:39:24,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-06 19:39:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:24,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2024-11-06 19:39:24,066 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 21 [2024-11-06 19:39:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:24,067 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2024-11-06 19:39:24,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2024-11-06 19:39:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-06 19:39:24,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:24,068 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 19:39:24,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:39:24,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:24,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1756349648, now seen corresponding path program 1 times [2024-11-06 19:39:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:24,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726132823] [2024-11-06 19:39:24,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:24,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:24,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:24,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726132823] [2024-11-06 19:39:24,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726132823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:24,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:24,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408769008] [2024-11-06 19:39:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:24,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:24,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:24,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:24,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:24,279 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:24,982 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2024-11-06 19:39:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:24,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 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 89 [2024-11-06 19:39:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:24,986 INFO L225 Difference]: With dead ends: 1211 [2024-11-06 19:39:24,986 INFO L226 Difference]: Without dead ends: 800 [2024-11-06 19:39:24,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:24,987 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:24,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-06 19:39:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2024-11-06 19:39:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:25,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2024-11-06 19:39:25,019 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 89 [2024-11-06 19:39:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:25,019 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2024-11-06 19:39:25,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2024-11-06 19:39:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-06 19:39:25,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:25,021 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 19:39:25,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:39:25,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:25,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1927914827, now seen corresponding path program 1 times [2024-11-06 19:39:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:25,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354764125] [2024-11-06 19:39:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:25,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:25,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354764125] [2024-11-06 19:39:25,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354764125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:25,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:25,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:39:25,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943077408] [2024-11-06 19:39:25,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:25,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:25,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:25,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:25,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:25,269 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:25,862 INFO L93 Difference]: Finished difference Result 1945 states and 2612 transitions. [2024-11-06 19:39:25,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:25,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 91 [2024-11-06 19:39:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:25,867 INFO L225 Difference]: With dead ends: 1945 [2024-11-06 19:39:25,868 INFO L226 Difference]: Without dead ends: 1158 [2024-11-06 19:39:25,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:25,871 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:25,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:39:25,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-06 19:39:25,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2024-11-06 19:39:25,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2707612456747406) internal successors, (1469), 1156 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:25,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1469 transitions. [2024-11-06 19:39:25,905 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1469 transitions. Word has length 91 [2024-11-06 19:39:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:25,905 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1469 transitions. [2024-11-06 19:39:25,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1469 transitions. [2024-11-06 19:39:25,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-06 19:39:25,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:25,911 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 19:39:25,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:39:25,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:25,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:25,911 INFO L85 PathProgramCache]: Analyzing trace with hash -682660523, now seen corresponding path program 1 times [2024-11-06 19:39:25,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:25,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566340383] [2024-11-06 19:39:25,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:25,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:39:26,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:26,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566340383] [2024-11-06 19:39:26,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566340383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:26,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:26,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425582515] [2024-11-06 19:39:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:26,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:26,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:26,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:26,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:26,101 INFO L87 Difference]: Start difference. First operand 1157 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:26,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:26,802 INFO L93 Difference]: Finished difference Result 2519 states and 3349 transitions. [2024-11-06 19:39:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:26,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 148 [2024-11-06 19:39:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:26,809 INFO L225 Difference]: With dead ends: 2519 [2024-11-06 19:39:26,809 INFO L226 Difference]: Without dead ends: 1548 [2024-11-06 19:39:26,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:26,813 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 214 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:26,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-06 19:39:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2024-11-06 19:39:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.2933937823834196) internal successors, (1997), 1544 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:26,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1997 transitions. [2024-11-06 19:39:26,843 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1997 transitions. Word has length 148 [2024-11-06 19:39:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:26,844 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1997 transitions. [2024-11-06 19:39:26,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1997 transitions. [2024-11-06 19:39:26,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-06 19:39:26,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:26,851 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:26,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:39:26,851 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:26,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:26,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1487557496, now seen corresponding path program 1 times [2024-11-06 19:39:26,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:26,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859508565] [2024-11-06 19:39:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:26,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-06 19:39:27,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:27,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859508565] [2024-11-06 19:39:27,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859508565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:27,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:27,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:27,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066349830] [2024-11-06 19:39:27,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:27,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:27,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:27,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:27,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:27,134 INFO L87 Difference]: Start difference. First operand 1545 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:27,934 INFO L93 Difference]: Finished difference Result 3643 states and 4872 transitions. [2024-11-06 19:39:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:27,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 203 [2024-11-06 19:39:27,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:27,942 INFO L225 Difference]: With dead ends: 3643 [2024-11-06 19:39:27,942 INFO L226 Difference]: Without dead ends: 2284 [2024-11-06 19:39:27,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:27,945 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 188 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:27,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 366 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:39:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2024-11-06 19:39:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2284. [2024-11-06 19:39:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2284 states, 2283 states have (on average 1.314060446780552) internal successors, (3000), 2283 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3000 transitions. [2024-11-06 19:39:27,998 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3000 transitions. Word has length 203 [2024-11-06 19:39:27,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:27,999 INFO L471 AbstractCegarLoop]: Abstraction has 2284 states and 3000 transitions. [2024-11-06 19:39:27,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3000 transitions. [2024-11-06 19:39:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-06 19:39:28,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:28,002 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:28,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:39:28,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:28,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1025688727, now seen corresponding path program 1 times [2024-11-06 19:39:28,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:28,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339367159] [2024-11-06 19:39:28,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:28,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-06 19:39:28,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:28,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339367159] [2024-11-06 19:39:28,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339367159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:28,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:28,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:28,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462371647] [2024-11-06 19:39:28,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:28,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:28,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:28,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:28,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:28,177 INFO L87 Difference]: Start difference. First operand 2284 states and 3000 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:28,847 INFO L93 Difference]: Finished difference Result 5310 states and 7081 transitions. [2024-11-06 19:39:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:28,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 214 [2024-11-06 19:39:28,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:28,857 INFO L225 Difference]: With dead ends: 5310 [2024-11-06 19:39:28,858 INFO L226 Difference]: Without dead ends: 3212 [2024-11-06 19:39:28,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:28,861 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 175 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:28,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 391 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:39:28,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2024-11-06 19:39:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 3203. [2024-11-06 19:39:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3203 states, 3202 states have (on average 1.2723297938788258) internal successors, (4074), 3202 states have internal predecessors, (4074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3203 states to 3203 states and 4074 transitions. [2024-11-06 19:39:28,907 INFO L78 Accepts]: Start accepts. Automaton has 3203 states and 4074 transitions. Word has length 214 [2024-11-06 19:39:28,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:28,907 INFO L471 AbstractCegarLoop]: Abstraction has 3203 states and 4074 transitions. [2024-11-06 19:39:28,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:28,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3203 states and 4074 transitions. [2024-11-06 19:39:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-06 19:39:28,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:28,909 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:28,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:39:28,910 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:28,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:28,910 INFO L85 PathProgramCache]: Analyzing trace with hash 307563977, now seen corresponding path program 1 times [2024-11-06 19:39:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:28,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117750260] [2024-11-06 19:39:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:28,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-06 19:39:29,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:29,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117750260] [2024-11-06 19:39:29,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117750260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:29,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:29,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:29,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063645627] [2024-11-06 19:39:29,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:29,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:29,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:29,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:29,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:29,010 INFO L87 Difference]: Start difference. First operand 3203 states and 4074 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:29,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:29,654 INFO L93 Difference]: Finished difference Result 8431 states and 10891 transitions. [2024-11-06 19:39:29,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:29,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 234 [2024-11-06 19:39:29,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:29,666 INFO L225 Difference]: With dead ends: 8431 [2024-11-06 19:39:29,666 INFO L226 Difference]: Without dead ends: 5414 [2024-11-06 19:39:29,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:29,670 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 209 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:29,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 270 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:39:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2024-11-06 19:39:29,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 5411. [2024-11-06 19:39:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5411 states, 5410 states have (on average 1.2541589648798521) internal successors, (6785), 5410 states have internal predecessors, (6785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5411 states to 5411 states and 6785 transitions. [2024-11-06 19:39:29,732 INFO L78 Accepts]: Start accepts. Automaton has 5411 states and 6785 transitions. Word has length 234 [2024-11-06 19:39:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:29,733 INFO L471 AbstractCegarLoop]: Abstraction has 5411 states and 6785 transitions. [2024-11-06 19:39:29,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5411 states and 6785 transitions. [2024-11-06 19:39:29,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-06 19:39:29,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:29,737 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:29,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:39:29,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:29,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:29,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1325455450, now seen corresponding path program 1 times [2024-11-06 19:39:29,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:29,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418837350] [2024-11-06 19:39:29,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-06 19:39:29,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:29,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418837350] [2024-11-06 19:39:29,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418837350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:29,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:29,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:29,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167921225] [2024-11-06 19:39:29,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:29,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:29,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:29,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:29,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:29,944 INFO L87 Difference]: Start difference. First operand 5411 states and 6785 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:30,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:30,636 INFO L93 Difference]: Finished difference Result 11937 states and 15194 transitions. [2024-11-06 19:39:30,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:30,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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 295 [2024-11-06 19:39:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:30,650 INFO L225 Difference]: With dead ends: 11937 [2024-11-06 19:39:30,650 INFO L226 Difference]: Without dead ends: 6712 [2024-11-06 19:39:30,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:30,656 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 184 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:30,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 336 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:39:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6712 states. [2024-11-06 19:39:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6712 to 6515. [2024-11-06 19:39:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6515 states, 6514 states have (on average 1.2331900521952717) internal successors, (8033), 6514 states have internal predecessors, (8033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6515 states to 6515 states and 8033 transitions. [2024-11-06 19:39:30,767 INFO L78 Accepts]: Start accepts. Automaton has 6515 states and 8033 transitions. Word has length 295 [2024-11-06 19:39:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:30,768 INFO L471 AbstractCegarLoop]: Abstraction has 6515 states and 8033 transitions. [2024-11-06 19:39:30,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6515 states and 8033 transitions. [2024-11-06 19:39:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-11-06 19:39:30,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:30,775 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:30,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:39:30,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:30,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:30,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1545495602, now seen corresponding path program 1 times [2024-11-06 19:39:30,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:30,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032594655] [2024-11-06 19:39:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-06 19:39:31,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:31,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032594655] [2024-11-06 19:39:31,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032594655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:31,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:31,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:31,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379039026] [2024-11-06 19:39:31,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:31,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:31,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:31,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:31,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:31,059 INFO L87 Difference]: Start difference. First operand 6515 states and 8033 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:31,703 INFO L93 Difference]: Finished difference Result 14332 states and 17687 transitions. [2024-11-06 19:39:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:31,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 356 [2024-11-06 19:39:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:31,734 INFO L225 Difference]: With dead ends: 14332 [2024-11-06 19:39:31,734 INFO L226 Difference]: Without dead ends: 7819 [2024-11-06 19:39:31,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:31,742 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 67 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:31,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 195 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:39:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2024-11-06 19:39:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 7435. [2024-11-06 19:39:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7435 states, 7434 states have (on average 1.2253161151466236) internal successors, (9109), 7434 states have internal predecessors, (9109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 9109 transitions. [2024-11-06 19:39:31,851 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 9109 transitions. Word has length 356 [2024-11-06 19:39:31,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:31,853 INFO L471 AbstractCegarLoop]: Abstraction has 7435 states and 9109 transitions. [2024-11-06 19:39:31,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9109 transitions. [2024-11-06 19:39:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-11-06 19:39:31,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:31,862 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:31,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:39:31,862 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:31,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:31,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2125057870, now seen corresponding path program 1 times [2024-11-06 19:39:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:31,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886224998] [2024-11-06 19:39:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-06 19:39:32,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:32,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886224998] [2024-11-06 19:39:32,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886224998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:32,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:32,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:32,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287685259] [2024-11-06 19:39:32,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:32,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:32,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:32,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:32,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:32,047 INFO L87 Difference]: Start difference. First operand 7435 states and 9109 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:32,639 INFO L93 Difference]: Finished difference Result 17075 states and 20963 transitions. [2024-11-06 19:39:32,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:32,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 379 [2024-11-06 19:39:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:32,657 INFO L225 Difference]: With dead ends: 17075 [2024-11-06 19:39:32,657 INFO L226 Difference]: Without dead ends: 9642 [2024-11-06 19:39:32,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:32,665 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 65 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:32,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 375 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:39:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9642 states. [2024-11-06 19:39:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9642 to 9642. [2024-11-06 19:39:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9642 states, 9641 states have (on average 1.2139819520796598) internal successors, (11704), 9641 states have internal predecessors, (11704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9642 states to 9642 states and 11704 transitions. [2024-11-06 19:39:32,752 INFO L78 Accepts]: Start accepts. Automaton has 9642 states and 11704 transitions. Word has length 379 [2024-11-06 19:39:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:32,752 INFO L471 AbstractCegarLoop]: Abstraction has 9642 states and 11704 transitions. [2024-11-06 19:39:32,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 9642 states and 11704 transitions. [2024-11-06 19:39:32,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2024-11-06 19:39:32,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:32,765 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:32,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:39:32,765 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:32,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1249107897, now seen corresponding path program 1 times [2024-11-06 19:39:32,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:32,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886321437] [2024-11-06 19:39:32,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:32,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-06 19:39:32,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:32,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886321437] [2024-11-06 19:39:32,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886321437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:32,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:32,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:32,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890457757] [2024-11-06 19:39:32,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:32,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:32,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:32,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:32,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:32,953 INFO L87 Difference]: Start difference. First operand 9642 states and 11704 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:33,483 INFO L93 Difference]: Finished difference Result 17786 states and 21583 transitions. [2024-11-06 19:39:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:33,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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 417 [2024-11-06 19:39:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:33,494 INFO L225 Difference]: With dead ends: 17786 [2024-11-06 19:39:33,495 INFO L226 Difference]: Without dead ends: 7594 [2024-11-06 19:39:33,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:33,503 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 106 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:33,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 147 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:39:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2024-11-06 19:39:33,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 6673. [2024-11-06 19:39:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6673 states, 6672 states have (on average 1.15302757793765) internal successors, (7693), 6672 states have internal predecessors, (7693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6673 states to 6673 states and 7693 transitions. [2024-11-06 19:39:33,561 INFO L78 Accepts]: Start accepts. Automaton has 6673 states and 7693 transitions. Word has length 417 [2024-11-06 19:39:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:33,562 INFO L471 AbstractCegarLoop]: Abstraction has 6673 states and 7693 transitions. [2024-11-06 19:39:33,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 6673 states and 7693 transitions. [2024-11-06 19:39:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2024-11-06 19:39:33,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:33,574 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:33,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:39:33,574 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:33,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:33,574 INFO L85 PathProgramCache]: Analyzing trace with hash 127474750, now seen corresponding path program 1 times [2024-11-06 19:39:33,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:33,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340243211] [2024-11-06 19:39:33,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:33,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 504 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-06 19:39:33,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:33,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340243211] [2024-11-06 19:39:33,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340243211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:39:33,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:39:33,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:39:33,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360129011] [2024-11-06 19:39:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:33,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:39:33,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:33,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:39:33,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:33,838 INFO L87 Difference]: Start difference. First operand 6673 states and 7693 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:34,469 INFO L93 Difference]: Finished difference Result 16487 states and 18944 transitions. [2024-11-06 19:39:34,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:39:34,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 481 [2024-11-06 19:39:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:34,485 INFO L225 Difference]: With dead ends: 16487 [2024-11-06 19:39:34,485 INFO L226 Difference]: Without dead ends: 9816 [2024-11-06 19:39:34,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:39:34,493 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:34,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 131 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:39:34,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9816 states. [2024-11-06 19:39:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9816 to 9630. [2024-11-06 19:39:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9630 states, 9629 states have (on average 1.12753141551563) internal successors, (10857), 9629 states have internal predecessors, (10857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:34,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9630 states to 9630 states and 10857 transitions. [2024-11-06 19:39:34,611 INFO L78 Accepts]: Start accepts. Automaton has 9630 states and 10857 transitions. Word has length 481 [2024-11-06 19:39:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:34,611 INFO L471 AbstractCegarLoop]: Abstraction has 9630 states and 10857 transitions. [2024-11-06 19:39:34,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 9630 states and 10857 transitions. [2024-11-06 19:39:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-11-06 19:39:34,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:39:34,627 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:39:34,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:39:34,627 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:39:34,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:39:34,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1327732137, now seen corresponding path program 1 times [2024-11-06 19:39:34,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:39:34,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510951637] [2024-11-06 19:39:34,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:34,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:39:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 156 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-06 19:39:35,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:39:35,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510951637] [2024-11-06 19:39:35,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510951637] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:39:35,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187521237] [2024-11-06 19:39:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:39:35,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:39:35,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:39:35,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:39:35,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 19:39:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:39:35,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 19:39:35,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:39:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 156 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-06 19:39:37,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:39:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-06 19:39:39,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187521237] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 19:39:39,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 19:39:39,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2024-11-06 19:39:39,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291186488] [2024-11-06 19:39:39,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:39:39,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:39:39,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:39:39,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:39:39,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:39:39,838 INFO L87 Difference]: Start difference. First operand 9630 states and 10857 transitions. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:39:40,874 INFO L93 Difference]: Finished difference Result 19810 states and 22306 transitions. [2024-11-06 19:39:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:39:40,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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 19:39:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:39:40,876 INFO L225 Difference]: With dead ends: 19810 [2024-11-06 19:39:40,876 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:39:40,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 977 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:39:40,886 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 328 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:39:40,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 45 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:39:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:39:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:39:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:39:40,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 491 [2024-11-06 19:39:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:39:40,887 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:39:40,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:39:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:39:40,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:39:40,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:39:40,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:39:41,093 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,SelfDestructingSolverStorable12 [2024-11-06 19:39:41,096 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:39:41,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:39:41,632 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:39:41,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:39:41 BoogieIcfgContainer [2024-11-06 19:39:41,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:39:41,653 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:39:41,653 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:39:41,653 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:39:41,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:39:22" (3/4) ... [2024-11-06 19:39:41,655 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:39:41,672 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 19:39:41,673 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:39:41,674 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:39:41,675 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:39:41,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:39:41,771 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:39:41,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:39:41,772 INFO L158 Benchmark]: Toolchain (without parser) took 21518.74ms. Allocated memory was 117.4MB in the beginning and 864.0MB in the end (delta: 746.6MB). Free memory was 88.4MB in the beginning and 615.4MB in the end (delta: -526.9MB). Peak memory consumption was 217.8MB. Max. memory is 16.1GB. [2024-11-06 19:39:41,772 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:39:41,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 839.14ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 44.6MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-06 19:39:41,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.42ms. Allocated memory is still 117.4MB. Free memory was 44.6MB in the beginning and 72.4MB in the end (delta: -27.7MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-06 19:39:41,773 INFO L158 Benchmark]: Boogie Preprocessor took 107.52ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 47.7MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 19:39:41,773 INFO L158 Benchmark]: RCFGBuilder took 1496.85ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 47.7MB in the beginning and 48.6MB in the end (delta: -961.0kB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2024-11-06 19:39:41,773 INFO L158 Benchmark]: TraceAbstraction took 18825.54ms. Allocated memory was 167.8MB in the beginning and 864.0MB in the end (delta: 696.3MB). Free memory was 47.6MB in the beginning and 627.8MB in the end (delta: -580.2MB). Peak memory consumption was 433.6MB. Max. memory is 16.1GB. [2024-11-06 19:39:41,773 INFO L158 Benchmark]: Witness Printer took 118.31ms. Allocated memory is still 864.0MB. Free memory was 627.8MB in the beginning and 615.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 19:39:41,774 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.61ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 839.14ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 44.6MB in the end (delta: 43.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.42ms. Allocated memory is still 117.4MB. Free memory was 44.6MB in the beginning and 72.4MB in the end (delta: -27.7MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.52ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 47.7MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1496.85ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 47.7MB in the beginning and 48.6MB in the end (delta: -961.0kB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18825.54ms. Allocated memory was 167.8MB in the beginning and 864.0MB in the end (delta: 696.3MB). Free memory was 47.6MB in the beginning and 627.8MB in the end (delta: -580.2MB). Peak memory consumption was 433.6MB. Max. memory is 16.1GB. * Witness Printer took 118.31ms. Allocated memory is still 864.0MB. Free memory was 627.8MB in the beginning and 615.4MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 79]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2142 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2142 mSDsluCounter, 3110 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 284 mSDsCounter, 1459 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7585 IncrementalHoareTripleChecker+Invalid, 9044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1459 mSolverCounterUnsat, 2826 mSDtfsCounter, 7585 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1018 GetRequests, 998 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9642occurred in iteration=10, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 1715 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 3910 NumberOfCodeBlocks, 3910 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4386 ConstructedInterpolants, 0 QuantifiedInterpolants, 19832 SizeOfPredicates, 0 NumberOfNonLiveVariables, 655 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 3748/4560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((a25 == 12) && ((0 < (((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 549139)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5))))) && (a4 == 1)) && ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5)) <= (549143 + ((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1))))) || (((a25 <= 10) && (a23 <= 138)) && (a4 == 1))) || (((((0 < (((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 549139)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5)))) && (a4 == 0)) && (a23 <= 138)) && ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5)) <= (549143 + ((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)))))) || ((((a25 == 13) && ((0 < (((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 549139)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5))))) && (a4 == 1)) && ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5)) <= (549143 + ((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)))))) || ((((((0 < (((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 549139)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5)))) && (a4 == 0)) && (a29 <= 220)) && ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5)) <= (549143 + ((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1))))) && (a25 == 10))) || ((141 <= a29) && (a4 == 1))) || (((a25 == 12) && (a23 <= 138)) && (a4 == 1))) || (((((0 < (((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 549139)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5)))) && (a25 <= 10)) && (a4 == 1)) && ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5)) <= (549143 + ((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)))))) || ((((a25 == 12) && ((0 < (((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 549139)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5))))) && (a4 == 0)) && ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5)) <= (549143 + ((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)))))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:39:41,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE