./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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', '64bit', '--witnessprinter.graph.data.programhash', 'ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb'] 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/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:56:32,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:56:32,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 02:56:32,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:56:32,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:56:32,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:56:32,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:56:32,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:56:32,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:56:32,479 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:56:32,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:56:32,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:56:32,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:56:32,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:56:32,479 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:56:32,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:56:32,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:56:32,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 02:56:32,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:56:32,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:56:32,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:56:32,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:56:32,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:56:32,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:56:32,480 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:56:32,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:56:32,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:56:32,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:56:32,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:56:32,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:56:32,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:56:32,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:56:32,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:56:32,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 02:56:32,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 02:56:32,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:56:32,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:56:32,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:56:32,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:56:32,482 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb [2024-11-07 02:56:32,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:56:32,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:56:32,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:56:32,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:56:32,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:56:32,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2024-11-07 02:56:34,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:56:34,350 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:56:34,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2024-11-07 02:56:34,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa7211ef8/3df379987266493a8b49ab25949db679/FLAG349314bbc [2024-11-07 02:56:34,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa7211ef8/3df379987266493a8b49ab25949db679 [2024-11-07 02:56:34,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:56:34,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:56:34,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:56:34,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:56:34,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:56:34,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:56:34" (1/1) ... [2024-11-07 02:56:34,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d5d75f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:34, skipping insertion in model container [2024-11-07 02:56:34,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:56:34" (1/1) ... [2024-11-07 02:56:34,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:56:34,845 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/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2024-11-07 02:56:34,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:56:34,947 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:56:34,961 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/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2024-11-07 02:56:35,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:56:35,031 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:56:35,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35 WrapperNode [2024-11-07 02:56:35,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:56:35,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:56:35,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:56:35,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:56:35,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35" (1/1) ... [2024-11-07 02:56:35,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35" (1/1) ... [2024-11-07 02:56:35,128 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 550 [2024-11-07 02:56:35,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:56:35,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:56:35,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:56:35,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:56:35,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35" (1/1) ... [2024-11-07 02:56:35,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35" (1/1) ... [2024-11-07 02:56:35,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35" (1/1) ... [2024-11-07 02:56:35,185 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-07 02:56:35,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35" (1/1) ... [2024-11-07 02:56:35,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35" (1/1) ... [2024-11-07 02:56:35,214 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35" (1/1) ... [2024-11-07 02:56:35,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35" (1/1) ... [2024-11-07 02:56:35,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35" (1/1) ... [2024-11-07 02:56:35,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35" (1/1) ... [2024-11-07 02:56:35,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:56:35,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:56:35,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:56:35,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:56:35,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35" (1/1) ... [2024-11-07 02:56:35,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:56:35,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:56:35,315 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-07 02:56:35,321 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-07 02:56:35,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:56:35,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 02:56:35,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:56:35,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:56:35,464 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:56:35,466 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:56:36,250 INFO L? ?]: Removed 359 outVars from TransFormulas that were not future-live. [2024-11-07 02:56:36,251 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:56:36,264 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:56:36,266 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:56:36,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:56:36 BoogieIcfgContainer [2024-11-07 02:56:36,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:56:36,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:56:36,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:56:36,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:56:36,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:56:34" (1/3) ... [2024-11-07 02:56:36,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516ced8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:56:36, skipping insertion in model container [2024-11-07 02:56:36,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:56:35" (2/3) ... [2024-11-07 02:56:36,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516ced8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:56:36, skipping insertion in model container [2024-11-07 02:56:36,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:56:36" (3/3) ... [2024-11-07 02:56:36,276 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Barrel.c [2024-11-07 02:56:36,307 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:56:36,307 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:56:36,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:56:36,380 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;@19ba2d17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:56:36,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:56:36,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 156 states have (on average 1.4935897435897436) internal successors, (233), 157 states have internal predecessors, (233), 0 states have call successors, (0), 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-07 02:56:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 02:56:36,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:36,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:36,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:36,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:36,401 INFO L85 PathProgramCache]: Analyzing trace with hash -808785509, now seen corresponding path program 1 times [2024-11-07 02:56:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:36,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061369505] [2024-11-07 02:56:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:36,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:37,564 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-07 02:56:37,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:37,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061369505] [2024-11-07 02:56:37,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061369505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:37,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:37,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:56:37,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639785553] [2024-11-07 02:56:37,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:37,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:56:37,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:37,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:56:37,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:56:37,590 INFO L87 Difference]: Start difference. First operand has 158 states, 156 states have (on average 1.4935897435897436) internal successors, (233), 157 states have internal predecessors, (233), 0 states have call successors, (0), 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 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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-07 02:56:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:37,674 INFO L93 Difference]: Finished difference Result 299 states and 444 transitions. [2024-11-07 02:56:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:56:37,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-07 02:56:37,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:37,684 INFO L225 Difference]: With dead ends: 299 [2024-11-07 02:56:37,685 INFO L226 Difference]: Without dead ends: 159 [2024-11-07 02:56:37,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:56:37,693 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 163 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:37,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 667 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:56:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-07 02:56:37,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2024-11-07 02:56:37,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4777070063694266) internal successors, (232), 157 states have internal predecessors, (232), 0 states have call successors, (0), 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-07 02:56:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 232 transitions. [2024-11-07 02:56:37,733 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 232 transitions. Word has length 79 [2024-11-07 02:56:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:37,734 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 232 transitions. [2024-11-07 02:56:37,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 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-07 02:56:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 232 transitions. [2024-11-07 02:56:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 02:56:37,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:37,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:37,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 02:56:37,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:37,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:37,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1698479195, now seen corresponding path program 1 times [2024-11-07 02:56:37,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:37,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540807863] [2024-11-07 02:56:37,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:37,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:38,206 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-07 02:56:38,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:38,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540807863] [2024-11-07 02:56:38,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540807863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:38,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:38,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:56:38,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894390256] [2024-11-07 02:56:38,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:38,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:56:38,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:38,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:56:38,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:56:38,210 INFO L87 Difference]: Start difference. First operand 158 states and 232 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 02:56:38,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:38,255 INFO L93 Difference]: Finished difference Result 304 states and 447 transitions. [2024-11-07 02:56:38,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:56:38,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-07 02:56:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:38,257 INFO L225 Difference]: With dead ends: 304 [2024-11-07 02:56:38,257 INFO L226 Difference]: Without dead ends: 164 [2024-11-07 02:56:38,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:56:38,258 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 4 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:38,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 892 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:56:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-07 02:56:38,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-07 02:56:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.4723926380368098) internal successors, (240), 163 states have internal predecessors, (240), 0 states have call successors, (0), 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-07 02:56:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 240 transitions. [2024-11-07 02:56:38,269 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 240 transitions. Word has length 80 [2024-11-07 02:56:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:38,270 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 240 transitions. [2024-11-07 02:56:38,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 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-07 02:56:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 240 transitions. [2024-11-07 02:56:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 02:56:38,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:38,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:38,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 02:56:38,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:38,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:38,275 INFO L85 PathProgramCache]: Analyzing trace with hash 813788120, now seen corresponding path program 1 times [2024-11-07 02:56:38,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:38,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772155849] [2024-11-07 02:56:38,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:38,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:38,816 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-07 02:56:38,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:38,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772155849] [2024-11-07 02:56:38,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772155849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:38,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:38,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:56:38,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600657807] [2024-11-07 02:56:38,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:38,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:56:38,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:38,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:56:38,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:56:38,819 INFO L87 Difference]: Start difference. First operand 164 states and 240 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 02:56:38,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:38,837 INFO L93 Difference]: Finished difference Result 168 states and 244 transitions. [2024-11-07 02:56:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:56:38,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-07 02:56:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:38,839 INFO L225 Difference]: With dead ends: 168 [2024-11-07 02:56:38,839 INFO L226 Difference]: Without dead ends: 166 [2024-11-07 02:56:38,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:56:38,840 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:38,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:56:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-07 02:56:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-11-07 02:56:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.4666666666666666) internal successors, (242), 165 states have internal predecessors, (242), 0 states have call successors, (0), 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-07 02:56:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 242 transitions. [2024-11-07 02:56:38,853 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 242 transitions. Word has length 81 [2024-11-07 02:56:38,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:38,853 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 242 transitions. [2024-11-07 02:56:38,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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-07 02:56:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 242 transitions. [2024-11-07 02:56:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 02:56:38,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:38,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:38,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 02:56:38,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:38,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:38,855 INFO L85 PathProgramCache]: Analyzing trace with hash -540676422, now seen corresponding path program 1 times [2024-11-07 02:56:38,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:38,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616897240] [2024-11-07 02:56:38,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:38,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:40,574 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-07 02:56:40,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:40,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616897240] [2024-11-07 02:56:40,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616897240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:40,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:40,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:56:40,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162477786] [2024-11-07 02:56:40,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:40,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:56:40,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:40,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:56:40,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:56:40,576 INFO L87 Difference]: Start difference. First operand 166 states and 242 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 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-07 02:56:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:40,808 INFO L93 Difference]: Finished difference Result 468 states and 683 transitions. [2024-11-07 02:56:40,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 02:56:40,808 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-07 02:56:40,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:40,810 INFO L225 Difference]: With dead ends: 468 [2024-11-07 02:56:40,810 INFO L226 Difference]: Without dead ends: 320 [2024-11-07 02:56:40,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-07 02:56:40,815 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 639 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:40,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1360 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:56:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-07 02:56:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 174. [2024-11-07 02:56:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.4566473988439306) internal successors, (252), 173 states have internal predecessors, (252), 0 states have call successors, (0), 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-07 02:56:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 252 transitions. [2024-11-07 02:56:40,830 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 252 transitions. Word has length 82 [2024-11-07 02:56:40,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:40,830 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 252 transitions. [2024-11-07 02:56:40,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 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-07 02:56:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 252 transitions. [2024-11-07 02:56:40,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 02:56:40,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:40,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:40,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 02:56:40,832 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:40,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:40,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1751935148, now seen corresponding path program 1 times [2024-11-07 02:56:40,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:40,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404249011] [2024-11-07 02:56:40,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:40,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:41,884 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-07 02:56:41,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:41,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404249011] [2024-11-07 02:56:41,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404249011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:41,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:41,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:56:41,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706236934] [2024-11-07 02:56:41,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:41,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:56:41,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:41,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:56:41,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:56:41,887 INFO L87 Difference]: Start difference. First operand 174 states and 252 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 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-07 02:56:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:42,152 INFO L93 Difference]: Finished difference Result 475 states and 691 transitions. [2024-11-07 02:56:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:56:42,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-07 02:56:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:42,154 INFO L225 Difference]: With dead ends: 475 [2024-11-07 02:56:42,154 INFO L226 Difference]: Without dead ends: 327 [2024-11-07 02:56:42,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:56:42,155 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 635 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:42,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1338 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:56:42,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-07 02:56:42,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 187. [2024-11-07 02:56:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.456989247311828) internal successors, (271), 186 states have internal predecessors, (271), 0 states have call successors, (0), 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-07 02:56:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 271 transitions. [2024-11-07 02:56:42,160 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 271 transitions. Word has length 83 [2024-11-07 02:56:42,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:42,161 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 271 transitions. [2024-11-07 02:56:42,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 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-07 02:56:42,161 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 271 transitions. [2024-11-07 02:56:42,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 02:56:42,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:42,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:42,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 02:56:42,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:42,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:42,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2009296888, now seen corresponding path program 1 times [2024-11-07 02:56:42,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:42,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807431843] [2024-11-07 02:56:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:42,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:42,988 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-07 02:56:42,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:42,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807431843] [2024-11-07 02:56:42,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807431843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:42,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:42,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:56:42,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37596168] [2024-11-07 02:56:42,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:42,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:56:42,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:42,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:56:42,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:56:42,991 INFO L87 Difference]: Start difference. First operand 187 states and 271 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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-07 02:56:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:43,202 INFO L93 Difference]: Finished difference Result 480 states and 698 transitions. [2024-11-07 02:56:43,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:56:43,203 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-07 02:56:43,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:43,205 INFO L225 Difference]: With dead ends: 480 [2024-11-07 02:56:43,207 INFO L226 Difference]: Without dead ends: 332 [2024-11-07 02:56:43,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:56:43,209 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 424 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:43,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1343 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:56:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-07 02:56:43,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 200. [2024-11-07 02:56:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.4522613065326633) internal successors, (289), 199 states have internal predecessors, (289), 0 states have call successors, (0), 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-07 02:56:43,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 289 transitions. [2024-11-07 02:56:43,225 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 289 transitions. Word has length 84 [2024-11-07 02:56:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:43,225 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 289 transitions. [2024-11-07 02:56:43,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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-07 02:56:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 289 transitions. [2024-11-07 02:56:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 02:56:43,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:43,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:43,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 02:56:43,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:43,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:43,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2015780803, now seen corresponding path program 1 times [2024-11-07 02:56:43,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:43,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573708018] [2024-11-07 02:56:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:43,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:44,046 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-07 02:56:44,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:44,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573708018] [2024-11-07 02:56:44,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573708018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:44,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:44,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:56:44,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770053751] [2024-11-07 02:56:44,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:44,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:56:44,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:44,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:56:44,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:56:44,048 INFO L87 Difference]: Start difference. First operand 200 states and 289 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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-07 02:56:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:44,126 INFO L93 Difference]: Finished difference Result 370 states and 537 transitions. [2024-11-07 02:56:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:56:44,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-07 02:56:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:44,128 INFO L225 Difference]: With dead ends: 370 [2024-11-07 02:56:44,128 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 02:56:44,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:56:44,129 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 4 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:44,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1492 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:56:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 02:56:44,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2024-11-07 02:56:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.448780487804878) internal successors, (297), 205 states have internal predecessors, (297), 0 states have call successors, (0), 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-07 02:56:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 297 transitions. [2024-11-07 02:56:44,137 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 297 transitions. Word has length 84 [2024-11-07 02:56:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:44,137 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 297 transitions. [2024-11-07 02:56:44,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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-07 02:56:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 297 transitions. [2024-11-07 02:56:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 02:56:44,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:44,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:44,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 02:56:44,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:44,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:44,138 INFO L85 PathProgramCache]: Analyzing trace with hash 268254877, now seen corresponding path program 1 times [2024-11-07 02:56:44,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:44,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197591516] [2024-11-07 02:56:44,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:44,867 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-07 02:56:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:44,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197591516] [2024-11-07 02:56:44,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197591516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:44,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:44,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:56:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155596846] [2024-11-07 02:56:44,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:44,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:56:44,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:44,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:56:44,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:56:44,869 INFO L87 Difference]: Start difference. First operand 206 states and 297 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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-07 02:56:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:44,880 INFO L93 Difference]: Finished difference Result 379 states and 549 transitions. [2024-11-07 02:56:44,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:56:44,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-07 02:56:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:44,881 INFO L225 Difference]: With dead ends: 379 [2024-11-07 02:56:44,881 INFO L226 Difference]: Without dead ends: 203 [2024-11-07 02:56:44,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:56:44,882 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:44,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:56:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-07 02:56:44,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-07 02:56:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.4405940594059405) internal successors, (291), 202 states have internal predecessors, (291), 0 states have call successors, (0), 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-07 02:56:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 291 transitions. [2024-11-07 02:56:44,886 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 291 transitions. Word has length 84 [2024-11-07 02:56:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:44,886 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 291 transitions. [2024-11-07 02:56:44,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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-07 02:56:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 291 transitions. [2024-11-07 02:56:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 02:56:44,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:44,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:44,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 02:56:44,887 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:44,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash 498255101, now seen corresponding path program 1 times [2024-11-07 02:56:44,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:44,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265982031] [2024-11-07 02:56:44,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:44,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:45,417 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-07 02:56:45,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:45,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265982031] [2024-11-07 02:56:45,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265982031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:45,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:45,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:56:45,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029793053] [2024-11-07 02:56:45,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:45,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:56:45,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:45,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:56:45,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:56:45,419 INFO L87 Difference]: Start difference. First operand 203 states and 291 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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-07 02:56:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:45,441 INFO L93 Difference]: Finished difference Result 368 states and 530 transitions. [2024-11-07 02:56:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:56:45,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-07 02:56:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:45,442 INFO L225 Difference]: With dead ends: 368 [2024-11-07 02:56:45,444 INFO L226 Difference]: Without dead ends: 190 [2024-11-07 02:56:45,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:56:45,445 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:45,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 660 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:56:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-07 02:56:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-07 02:56:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.433862433862434) internal successors, (271), 189 states have internal predecessors, (271), 0 states have call successors, (0), 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-07 02:56:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 271 transitions. [2024-11-07 02:56:45,456 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 271 transitions. Word has length 84 [2024-11-07 02:56:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:45,456 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 271 transitions. [2024-11-07 02:56:45,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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-07 02:56:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 271 transitions. [2024-11-07 02:56:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 02:56:45,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:45,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:45,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 02:56:45,457 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:45,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1636798918, now seen corresponding path program 1 times [2024-11-07 02:56:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:45,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828327260] [2024-11-07 02:56:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:46,148 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-07 02:56:46,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:46,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828327260] [2024-11-07 02:56:46,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828327260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:46,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:46,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:56:46,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967691778] [2024-11-07 02:56:46,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:46,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:56:46,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:46,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:56:46,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:56:46,151 INFO L87 Difference]: Start difference. First operand 190 states and 271 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 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-07 02:56:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:46,529 INFO L93 Difference]: Finished difference Result 478 states and 689 transitions. [2024-11-07 02:56:46,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:56:46,529 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-07 02:56:46,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:46,531 INFO L225 Difference]: With dead ends: 478 [2024-11-07 02:56:46,531 INFO L226 Difference]: Without dead ends: 327 [2024-11-07 02:56:46,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:56:46,532 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 405 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:46,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1303 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 02:56:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-07 02:56:46,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 203. [2024-11-07 02:56:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.4306930693069306) internal successors, (289), 202 states have internal predecessors, (289), 0 states have call successors, (0), 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-07 02:56:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 289 transitions. [2024-11-07 02:56:46,542 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 289 transitions. Word has length 85 [2024-11-07 02:56:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:46,542 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 289 transitions. [2024-11-07 02:56:46,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 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-07 02:56:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 289 transitions. [2024-11-07 02:56:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 02:56:46,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:46,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:46,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 02:56:46,543 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:46,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:46,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1025499375, now seen corresponding path program 1 times [2024-11-07 02:56:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:46,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312028076] [2024-11-07 02:56:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:46,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:47,189 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-07 02:56:47,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:47,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312028076] [2024-11-07 02:56:47,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312028076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:47,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:47,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 02:56:47,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274653414] [2024-11-07 02:56:47,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:47,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 02:56:47,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:47,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 02:56:47,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 02:56:47,192 INFO L87 Difference]: Start difference. First operand 203 states and 289 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 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-07 02:56:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:47,313 INFO L93 Difference]: Finished difference Result 382 states and 548 transitions. [2024-11-07 02:56:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 02:56:47,313 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-07 02:56:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:47,314 INFO L225 Difference]: With dead ends: 382 [2024-11-07 02:56:47,314 INFO L226 Difference]: Without dead ends: 218 [2024-11-07 02:56:47,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-07 02:56:47,315 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 6 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:47,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1836 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:56:47,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-07 02:56:47,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2024-11-07 02:56:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.4232558139534883) internal successors, (306), 215 states have internal predecessors, (306), 0 states have call successors, (0), 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-07 02:56:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 306 transitions. [2024-11-07 02:56:47,321 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 306 transitions. Word has length 85 [2024-11-07 02:56:47,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:47,321 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 306 transitions. [2024-11-07 02:56:47,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 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-07 02:56:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 306 transitions. [2024-11-07 02:56:47,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-07 02:56:47,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:47,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:47,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 02:56:47,322 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:47,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:47,323 INFO L85 PathProgramCache]: Analyzing trace with hash 160542543, now seen corresponding path program 1 times [2024-11-07 02:56:47,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:47,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077086395] [2024-11-07 02:56:47,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:47,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:47,790 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-07 02:56:47,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:47,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077086395] [2024-11-07 02:56:47,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077086395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:47,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:47,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:56:47,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969377466] [2024-11-07 02:56:47,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:47,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:56:47,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:47,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:56:47,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:56:47,795 INFO L87 Difference]: Start difference. First operand 216 states and 306 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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-07 02:56:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:47,896 INFO L93 Difference]: Finished difference Result 399 states and 571 transitions. [2024-11-07 02:56:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:56:47,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-07 02:56:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:47,897 INFO L225 Difference]: With dead ends: 399 [2024-11-07 02:56:47,897 INFO L226 Difference]: Without dead ends: 226 [2024-11-07 02:56:47,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:56:47,898 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 3 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:47,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1265 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:56:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-07 02:56:47,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 222. [2024-11-07 02:56:47,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.420814479638009) internal successors, (314), 221 states have internal predecessors, (314), 0 states have call successors, (0), 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-07 02:56:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 314 transitions. [2024-11-07 02:56:47,903 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 314 transitions. Word has length 85 [2024-11-07 02:56:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:47,903 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 314 transitions. [2024-11-07 02:56:47,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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-07 02:56:47,903 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 314 transitions. [2024-11-07 02:56:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 02:56:47,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:47,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:47,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 02:56:47,904 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:47,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash -802047253, now seen corresponding path program 1 times [2024-11-07 02:56:47,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:47,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173999686] [2024-11-07 02:56:47,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:47,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:48,358 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-07 02:56:48,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:48,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173999686] [2024-11-07 02:56:48,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173999686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:48,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:48,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:56:48,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965678168] [2024-11-07 02:56:48,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:48,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:56:48,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:48,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:56:48,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:56:48,360 INFO L87 Difference]: Start difference. First operand 222 states and 314 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 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-07 02:56:48,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:48,447 INFO L93 Difference]: Finished difference Result 403 states and 576 transitions. [2024-11-07 02:56:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:56:48,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-07 02:56:48,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:48,449 INFO L225 Difference]: With dead ends: 403 [2024-11-07 02:56:48,449 INFO L226 Difference]: Without dead ends: 234 [2024-11-07 02:56:48,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:56:48,450 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 3 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:48,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1279 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:56:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-07 02:56:48,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 229. [2024-11-07 02:56:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4166666666666667) internal successors, (323), 228 states have internal predecessors, (323), 0 states have call successors, (0), 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-07 02:56:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 323 transitions. [2024-11-07 02:56:48,460 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 323 transitions. Word has length 86 [2024-11-07 02:56:48,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:48,460 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 323 transitions. [2024-11-07 02:56:48,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 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-07 02:56:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 323 transitions. [2024-11-07 02:56:48,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 02:56:48,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:48,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:48,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 02:56:48,462 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:48,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:48,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1987926186, now seen corresponding path program 1 times [2024-11-07 02:56:48,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:48,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526510049] [2024-11-07 02:56:48,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:48,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:49,144 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-07 02:56:49,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:49,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526510049] [2024-11-07 02:56:49,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526510049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:49,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:49,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:56:49,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388444069] [2024-11-07 02:56:49,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:49,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:56:49,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:49,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:56:49,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:56:49,145 INFO L87 Difference]: Start difference. First operand 229 states and 323 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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-07 02:56:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:49,312 INFO L93 Difference]: Finished difference Result 533 states and 762 transitions. [2024-11-07 02:56:49,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:56:49,312 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-07 02:56:49,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:49,313 INFO L225 Difference]: With dead ends: 533 [2024-11-07 02:56:49,313 INFO L226 Difference]: Without dead ends: 358 [2024-11-07 02:56:49,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:56:49,314 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 575 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:49,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1364 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:56:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-07 02:56:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 242. [2024-11-07 02:56:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.4149377593360997) internal successors, (341), 241 states have internal predecessors, (341), 0 states have call successors, (0), 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-07 02:56:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 341 transitions. [2024-11-07 02:56:49,322 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 341 transitions. Word has length 86 [2024-11-07 02:56:49,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:49,323 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 341 transitions. [2024-11-07 02:56:49,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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-07 02:56:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 341 transitions. [2024-11-07 02:56:49,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 02:56:49,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:49,324 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:49,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 02:56:49,324 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:49,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:49,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2133214069, now seen corresponding path program 1 times [2024-11-07 02:56:49,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:49,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941371629] [2024-11-07 02:56:49,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:49,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:50,200 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-07 02:56:50,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:50,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941371629] [2024-11-07 02:56:50,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941371629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:50,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:50,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 02:56:50,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188228673] [2024-11-07 02:56:50,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:50,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 02:56:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:50,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 02:56:50,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-07 02:56:50,202 INFO L87 Difference]: Start difference. First operand 242 states and 341 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 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-07 02:56:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:50,454 INFO L93 Difference]: Finished difference Result 450 states and 640 transitions. [2024-11-07 02:56:50,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 02:56:50,455 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-07 02:56:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:50,456 INFO L225 Difference]: With dead ends: 450 [2024-11-07 02:56:50,456 INFO L226 Difference]: Without dead ends: 262 [2024-11-07 02:56:50,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-07 02:56:50,458 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 11 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:50,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2573 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:56:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-07 02:56:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 259. [2024-11-07 02:56:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.4108527131782946) internal successors, (364), 258 states have internal predecessors, (364), 0 states have call successors, (0), 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-07 02:56:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 364 transitions. [2024-11-07 02:56:50,463 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 364 transitions. Word has length 86 [2024-11-07 02:56:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:50,463 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 364 transitions. [2024-11-07 02:56:50,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 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-07 02:56:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 364 transitions. [2024-11-07 02:56:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-07 02:56:50,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:50,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:50,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 02:56:50,465 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:50,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:50,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1233244, now seen corresponding path program 1 times [2024-11-07 02:56:50,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:50,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422820495] [2024-11-07 02:56:50,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:50,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:50,820 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-07 02:56:50,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:50,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422820495] [2024-11-07 02:56:50,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422820495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:50,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:50,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:56:50,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897120197] [2024-11-07 02:56:50,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:50,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:56:50,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:50,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:56:50,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:56:50,823 INFO L87 Difference]: Start difference. First operand 259 states and 364 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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-07 02:56:50,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:50,898 INFO L93 Difference]: Finished difference Result 599 states and 849 transitions. [2024-11-07 02:56:50,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:56:50,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-07 02:56:50,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:50,900 INFO L225 Difference]: With dead ends: 599 [2024-11-07 02:56:50,900 INFO L226 Difference]: Without dead ends: 372 [2024-11-07 02:56:50,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:56:50,901 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 399 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:50,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 611 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:56:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-07 02:56:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 259. [2024-11-07 02:56:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.4069767441860466) internal successors, (363), 258 states have internal predecessors, (363), 0 states have call successors, (0), 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-07 02:56:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 363 transitions. [2024-11-07 02:56:50,908 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 363 transitions. Word has length 86 [2024-11-07 02:56:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:50,908 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 363 transitions. [2024-11-07 02:56:50,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 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-07 02:56:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 363 transitions. [2024-11-07 02:56:50,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 02:56:50,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:50,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:50,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 02:56:50,909 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:50,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash -696215096, now seen corresponding path program 1 times [2024-11-07 02:56:50,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:50,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199471445] [2024-11-07 02:56:50,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:50,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:51,524 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-07 02:56:51,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:51,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199471445] [2024-11-07 02:56:51,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199471445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:51,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:51,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:56:51,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484964782] [2024-11-07 02:56:51,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:51,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:56:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:51,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:56:51,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:56:51,527 INFO L87 Difference]: Start difference. First operand 259 states and 363 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 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-07 02:56:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:51,734 INFO L93 Difference]: Finished difference Result 569 states and 810 transitions. [2024-11-07 02:56:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:56:51,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-07 02:56:51,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:51,737 INFO L225 Difference]: With dead ends: 569 [2024-11-07 02:56:51,737 INFO L226 Difference]: Without dead ends: 380 [2024-11-07 02:56:51,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:56:51,738 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 392 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:51,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1365 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:56:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-07 02:56:51,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 272. [2024-11-07 02:56:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.4059040590405905) internal successors, (381), 271 states have internal predecessors, (381), 0 states have call successors, (0), 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-07 02:56:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 381 transitions. [2024-11-07 02:56:51,746 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 381 transitions. Word has length 87 [2024-11-07 02:56:51,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:51,746 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 381 transitions. [2024-11-07 02:56:51,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 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-07 02:56:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 381 transitions. [2024-11-07 02:56:51,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 02:56:51,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:51,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:51,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 02:56:51,749 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:51,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:51,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2092208509, now seen corresponding path program 1 times [2024-11-07 02:56:51,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:51,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727975929] [2024-11-07 02:56:51,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:51,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:52,895 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-07 02:56:52,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:52,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727975929] [2024-11-07 02:56:52,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727975929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:52,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:52,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 02:56:52,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900956319] [2024-11-07 02:56:52,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:52,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 02:56:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:52,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 02:56:52,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2024-11-07 02:56:52,897 INFO L87 Difference]: Start difference. First operand 272 states and 381 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 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-07 02:56:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:53,256 INFO L93 Difference]: Finished difference Result 506 states and 716 transitions. [2024-11-07 02:56:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 02:56:53,257 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-07 02:56:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:53,258 INFO L225 Difference]: With dead ends: 506 [2024-11-07 02:56:53,258 INFO L226 Difference]: Without dead ends: 304 [2024-11-07 02:56:53,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2024-11-07 02:56:53,260 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 18 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3306 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:53,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3306 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 02:56:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-07 02:56:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2024-11-07 02:56:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.4054054054054055) internal successors, (416), 296 states have internal predecessors, (416), 0 states have call successors, (0), 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-07 02:56:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 416 transitions. [2024-11-07 02:56:53,267 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 416 transitions. Word has length 87 [2024-11-07 02:56:53,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:53,268 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 416 transitions. [2024-11-07 02:56:53,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 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-07 02:56:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 416 transitions. [2024-11-07 02:56:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 02:56:53,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:53,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:53,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 02:56:53,270 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:53,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1718960163, now seen corresponding path program 1 times [2024-11-07 02:56:53,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:53,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704572333] [2024-11-07 02:56:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:53,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:53,995 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-07 02:56:53,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:53,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704572333] [2024-11-07 02:56:53,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704572333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:53,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:53,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:56:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457490279] [2024-11-07 02:56:53,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:53,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:56:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:53,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:56:53,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:56:53,997 INFO L87 Difference]: Start difference. First operand 297 states and 416 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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-07 02:56:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:54,118 INFO L93 Difference]: Finished difference Result 530 states and 751 transitions. [2024-11-07 02:56:54,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:56:54,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-07 02:56:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:54,119 INFO L225 Difference]: With dead ends: 530 [2024-11-07 02:56:54,119 INFO L226 Difference]: Without dead ends: 310 [2024-11-07 02:56:54,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:56:54,120 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 3 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:54,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1269 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:56:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-07 02:56:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 304. [2024-11-07 02:56:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.4026402640264026) internal successors, (425), 303 states have internal predecessors, (425), 0 states have call successors, (0), 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-07 02:56:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 425 transitions. [2024-11-07 02:56:54,126 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 425 transitions. Word has length 87 [2024-11-07 02:56:54,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:54,126 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 425 transitions. [2024-11-07 02:56:54,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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-07 02:56:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 425 transitions. [2024-11-07 02:56:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 02:56:54,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:54,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:54,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 02:56:54,127 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:54,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:54,127 INFO L85 PathProgramCache]: Analyzing trace with hash 705563346, now seen corresponding path program 1 times [2024-11-07 02:56:54,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:54,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294640554] [2024-11-07 02:56:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:54,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:54,564 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-07 02:56:54,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:54,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294640554] [2024-11-07 02:56:54,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294640554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:54,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:54,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:56:54,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458579385] [2024-11-07 02:56:54,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:54,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:56:54,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:54,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:56:54,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:56:54,566 INFO L87 Difference]: Start difference. First operand 304 states and 425 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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-07 02:56:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:54,701 INFO L93 Difference]: Finished difference Result 638 states and 901 transitions. [2024-11-07 02:56:54,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:56:54,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-07 02:56:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:54,702 INFO L225 Difference]: With dead ends: 638 [2024-11-07 02:56:54,702 INFO L226 Difference]: Without dead ends: 364 [2024-11-07 02:56:54,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:56:54,703 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 510 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:54,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 615 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:56:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-07 02:56:54,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 289. [2024-11-07 02:56:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.3993055555555556) internal successors, (403), 288 states have internal predecessors, (403), 0 states have call successors, (0), 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-07 02:56:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 403 transitions. [2024-11-07 02:56:54,711 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 403 transitions. Word has length 87 [2024-11-07 02:56:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:54,711 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 403 transitions. [2024-11-07 02:56:54,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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-07 02:56:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 403 transitions. [2024-11-07 02:56:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 02:56:54,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:54,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:54,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 02:56:54,712 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:54,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:54,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1607484754, now seen corresponding path program 1 times [2024-11-07 02:56:54,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:54,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576010280] [2024-11-07 02:56:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:54,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:55,127 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-07 02:56:55,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:55,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576010280] [2024-11-07 02:56:55,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576010280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:55,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:55,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:56:55,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409413349] [2024-11-07 02:56:55,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:55,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:56:55,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:55,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:56:55,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:56:55,129 INFO L87 Difference]: Start difference. First operand 289 states and 403 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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-07 02:56:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:55,167 INFO L93 Difference]: Finished difference Result 528 states and 743 transitions. [2024-11-07 02:56:55,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:56:55,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-07 02:56:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:55,168 INFO L225 Difference]: With dead ends: 528 [2024-11-07 02:56:55,168 INFO L226 Difference]: Without dead ends: 274 [2024-11-07 02:56:55,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:56:55,169 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:55,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 654 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:56:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-07 02:56:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-07 02:56:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.3919413919413919) internal successors, (380), 273 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:56:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 380 transitions. [2024-11-07 02:56:55,173 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 380 transitions. Word has length 88 [2024-11-07 02:56:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:55,174 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 380 transitions. [2024-11-07 02:56:55,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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-07 02:56:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 380 transitions. [2024-11-07 02:56:55,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 02:56:55,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:55,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:55,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 02:56:55,175 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:55,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:55,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1543255204, now seen corresponding path program 1 times [2024-11-07 02:56:55,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:55,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492372926] [2024-11-07 02:56:55,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:55,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:55,781 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-07 02:56:55,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:55,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492372926] [2024-11-07 02:56:55,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492372926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:55,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:55,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:56:55,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010853127] [2024-11-07 02:56:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:55,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:56:55,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:55,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:56:55,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:56:55,783 INFO L87 Difference]: Start difference. First operand 274 states and 380 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 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-07 02:56:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:55,970 INFO L93 Difference]: Finished difference Result 598 states and 844 transitions. [2024-11-07 02:56:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:56:55,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-07 02:56:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:55,975 INFO L225 Difference]: With dead ends: 598 [2024-11-07 02:56:55,978 INFO L226 Difference]: Without dead ends: 387 [2024-11-07 02:56:55,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:56:55,980 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 523 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:55,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1350 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:56:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-07 02:56:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 287. [2024-11-07 02:56:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.3916083916083917) internal successors, (398), 286 states have internal predecessors, (398), 0 states have call successors, (0), 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-07 02:56:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 398 transitions. [2024-11-07 02:56:55,985 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 398 transitions. Word has length 88 [2024-11-07 02:56:55,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:55,985 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 398 transitions. [2024-11-07 02:56:55,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 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-07 02:56:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 398 transitions. [2024-11-07 02:56:55,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 02:56:55,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:55,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:55,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 02:56:55,986 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:55,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:55,987 INFO L85 PathProgramCache]: Analyzing trace with hash -203272487, now seen corresponding path program 1 times [2024-11-07 02:56:55,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:55,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699178235] [2024-11-07 02:56:55,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:55,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:56,935 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-07 02:56:56,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:56,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699178235] [2024-11-07 02:56:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699178235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:56,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:56,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-07 02:56:56,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953622804] [2024-11-07 02:56:56,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:56,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 02:56:56,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:56,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 02:56:56,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2024-11-07 02:56:56,937 INFO L87 Difference]: Start difference. First operand 287 states and 398 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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-07 02:56:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:57,337 INFO L93 Difference]: Finished difference Result 546 states and 767 transitions. [2024-11-07 02:56:57,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 02:56:57,337 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-07 02:56:57,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:57,338 INFO L225 Difference]: With dead ends: 546 [2024-11-07 02:56:57,338 INFO L226 Difference]: Without dead ends: 322 [2024-11-07 02:56:57,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2024-11-07 02:56:57,339 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 19 mSDsluCounter, 3256 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3439 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:57,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3439 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 02:56:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-07 02:56:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2024-11-07 02:56:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 1.3887147335423198) internal successors, (443), 319 states have internal predecessors, (443), 0 states have call successors, (0), 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-07 02:56:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 443 transitions. [2024-11-07 02:56:57,344 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 443 transitions. Word has length 88 [2024-11-07 02:56:57,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:57,344 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 443 transitions. [2024-11-07 02:56:57,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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-07 02:56:57,345 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 443 transitions. [2024-11-07 02:56:57,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 02:56:57,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:57,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:57,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 02:56:57,345 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:57,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:57,346 INFO L85 PathProgramCache]: Analyzing trace with hash 885959993, now seen corresponding path program 1 times [2024-11-07 02:56:57,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:57,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719465630] [2024-11-07 02:56:57,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:57,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:57,770 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-07 02:56:57,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:57,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719465630] [2024-11-07 02:56:57,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719465630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:57,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:57,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:56:57,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501115386] [2024-11-07 02:56:57,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:57,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:56:57,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:57,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:56:57,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:56:57,772 INFO L87 Difference]: Start difference. First operand 320 states and 443 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 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-07 02:56:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:57,831 INFO L93 Difference]: Finished difference Result 588 states and 824 transitions. [2024-11-07 02:56:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:56:57,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-07 02:56:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:57,832 INFO L225 Difference]: With dead ends: 588 [2024-11-07 02:56:57,832 INFO L226 Difference]: Without dead ends: 335 [2024-11-07 02:56:57,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:56:57,833 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 3 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:57,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1257 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:56:57,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-07 02:56:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 331. [2024-11-07 02:56:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.3848484848484848) internal successors, (457), 330 states have internal predecessors, (457), 0 states have call successors, (0), 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-07 02:56:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 457 transitions. [2024-11-07 02:56:57,839 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 457 transitions. Word has length 88 [2024-11-07 02:56:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:57,840 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 457 transitions. [2024-11-07 02:56:57,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 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-07 02:56:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 457 transitions. [2024-11-07 02:56:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 02:56:57,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:57,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:57,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 02:56:57,841 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:57,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:57,841 INFO L85 PathProgramCache]: Analyzing trace with hash -429758453, now seen corresponding path program 1 times [2024-11-07 02:56:57,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:57,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578681741] [2024-11-07 02:56:57,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:57,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:56:58,841 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-07 02:56:58,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:56:58,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578681741] [2024-11-07 02:56:58,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578681741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:56:58,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:56:58,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-07 02:56:58,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477412018] [2024-11-07 02:56:58,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:56:58,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 02:56:58,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:56:58,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 02:56:58,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2024-11-07 02:56:58,843 INFO L87 Difference]: Start difference. First operand 331 states and 457 transitions. Second operand has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 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-07 02:56:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:56:59,425 INFO L93 Difference]: Finished difference Result 618 states and 862 transitions. [2024-11-07 02:56:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-07 02:56:59,426 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 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-07 02:56:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:56:59,427 INFO L225 Difference]: With dead ends: 618 [2024-11-07 02:56:59,431 INFO L226 Difference]: Without dead ends: 369 [2024-11-07 02:56:59,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2024-11-07 02:56:59,432 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 26 mSDsluCounter, 3989 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4182 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 02:56:59,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4182 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 02:56:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-07 02:56:59,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 360. [2024-11-07 02:56:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.384401114206128) internal successors, (497), 359 states have internal predecessors, (497), 0 states have call successors, (0), 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-07 02:56:59,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 497 transitions. [2024-11-07 02:56:59,449 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 497 transitions. Word has length 89 [2024-11-07 02:56:59,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:56:59,449 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 497 transitions. [2024-11-07 02:56:59,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.7083333333333335) internal successors, (89), 24 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-07 02:56:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 497 transitions. [2024-11-07 02:56:59,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 02:56:59,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:56:59,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:56:59,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 02:56:59,450 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:56:59,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:56:59,450 INFO L85 PathProgramCache]: Analyzing trace with hash -581637290, now seen corresponding path program 1 times [2024-11-07 02:56:59,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:56:59,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173785562] [2024-11-07 02:56:59,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:56:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:56:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:00,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:00,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173785562] [2024-11-07 02:57:00,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173785562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:00,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:00,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:57:00,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365600588] [2024-11-07 02:57:00,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:00,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:57:00,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:00,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:57:00,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:57:00,361 INFO L87 Difference]: Start difference. First operand 360 states and 497 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 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-07 02:57:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:00,509 INFO L93 Difference]: Finished difference Result 736 states and 1032 transitions. [2024-11-07 02:57:00,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:57:00,509 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 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-07 02:57:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:00,511 INFO L225 Difference]: With dead ends: 736 [2024-11-07 02:57:00,511 INFO L226 Difference]: Without dead ends: 465 [2024-11-07 02:57:00,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:57:00,512 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 514 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:00,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1349 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:00,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-07 02:57:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 373. [2024-11-07 02:57:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.3844086021505377) internal successors, (515), 372 states have internal predecessors, (515), 0 states have call successors, (0), 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-07 02:57:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 515 transitions. [2024-11-07 02:57:00,518 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 515 transitions. Word has length 89 [2024-11-07 02:57:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:00,518 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 515 transitions. [2024-11-07 02:57:00,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 9 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-07 02:57:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 515 transitions. [2024-11-07 02:57:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 02:57:00,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:00,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:00,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 02:57:00,519 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:00,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:00,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1375930773, now seen corresponding path program 1 times [2024-11-07 02:57:00,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:00,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041743105] [2024-11-07 02:57:00,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:00,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:00,872 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-07 02:57:00,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:00,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041743105] [2024-11-07 02:57:00,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041743105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:00,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:00,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:57:00,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110476917] [2024-11-07 02:57:00,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:00,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:57:00,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:00,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:57:00,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:00,875 INFO L87 Difference]: Start difference. First operand 373 states and 515 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 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-07 02:57:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:00,885 INFO L93 Difference]: Finished difference Result 664 states and 927 transitions. [2024-11-07 02:57:00,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:57:00,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 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-07 02:57:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:00,887 INFO L225 Difference]: With dead ends: 664 [2024-11-07 02:57:00,887 INFO L226 Difference]: Without dead ends: 370 [2024-11-07 02:57:00,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:00,888 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:00,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-07 02:57:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-11-07 02:57:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 1.3766937669376693) internal successors, (508), 369 states have internal predecessors, (508), 0 states have call successors, (0), 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-07 02:57:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 508 transitions. [2024-11-07 02:57:00,895 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 508 transitions. Word has length 89 [2024-11-07 02:57:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:00,895 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 508 transitions. [2024-11-07 02:57:00,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 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-07 02:57:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 508 transitions. [2024-11-07 02:57:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 02:57:00,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:00,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:00,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 02:57:00,896 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:00,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash 444663392, now seen corresponding path program 1 times [2024-11-07 02:57:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:00,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078573998] [2024-11-07 02:57:00,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:00,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:01,278 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-07 02:57:01,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:01,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078573998] [2024-11-07 02:57:01,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078573998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:01,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:01,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:57:01,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389980087] [2024-11-07 02:57:01,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:01,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:57:01,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:01,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:57:01,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:57:01,279 INFO L87 Difference]: Start difference. First operand 370 states and 508 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-07 02:57:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:01,337 INFO L93 Difference]: Finished difference Result 769 states and 1068 transitions. [2024-11-07 02:57:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:57:01,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-07 02:57:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:01,339 INFO L225 Difference]: With dead ends: 769 [2024-11-07 02:57:01,339 INFO L226 Difference]: Without dead ends: 439 [2024-11-07 02:57:01,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:57:01,340 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 510 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:01,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 602 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:01,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-07 02:57:01,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 350. [2024-11-07 02:57:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.3782234957020056) internal successors, (481), 349 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 481 transitions. [2024-11-07 02:57:01,347 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 481 transitions. Word has length 89 [2024-11-07 02:57:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:01,347 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 481 transitions. [2024-11-07 02:57:01,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 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-07 02:57:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 481 transitions. [2024-11-07 02:57:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 02:57:01,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:01,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:01,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 02:57:01,348 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:01,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:01,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1332922382, now seen corresponding path program 1 times [2024-11-07 02:57:01,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:01,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224062587] [2024-11-07 02:57:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:01,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:02,101 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-07 02:57:02,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:02,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224062587] [2024-11-07 02:57:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224062587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:02,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:02,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:57:02,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664982872] [2024-11-07 02:57:02,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:02,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:57:02,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:02,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:57:02,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:57:02,103 INFO L87 Difference]: Start difference. First operand 350 states and 481 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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-07 02:57:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:02,276 INFO L93 Difference]: Finished difference Result 717 states and 1002 transitions. [2024-11-07 02:57:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:57:02,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-07 02:57:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:02,279 INFO L225 Difference]: With dead ends: 717 [2024-11-07 02:57:02,279 INFO L226 Difference]: Without dead ends: 447 [2024-11-07 02:57:02,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:57:02,280 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 485 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:02,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1332 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-07 02:57:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 362. [2024-11-07 02:57:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.3795013850415512) internal successors, (498), 361 states have internal predecessors, (498), 0 states have call successors, (0), 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-07 02:57:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 498 transitions. [2024-11-07 02:57:02,285 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 498 transitions. Word has length 90 [2024-11-07 02:57:02,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:02,285 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 498 transitions. [2024-11-07 02:57:02,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 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-07 02:57:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 498 transitions. [2024-11-07 02:57:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 02:57:02,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:02,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:02,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 02:57:02,286 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:02,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:02,286 INFO L85 PathProgramCache]: Analyzing trace with hash 920082215, now seen corresponding path program 1 times [2024-11-07 02:57:02,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:02,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399967559] [2024-11-07 02:57:02,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:02,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:03,392 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-07 02:57:03,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:03,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399967559] [2024-11-07 02:57:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399967559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:03,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:03,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-11-07 02:57:03,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561286205] [2024-11-07 02:57:03,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:03,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 02:57:03,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:03,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 02:57:03,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2024-11-07 02:57:03,394 INFO L87 Difference]: Start difference. First operand 362 states and 498 transitions. Second operand has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 0 states have call successors, (0), 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-07 02:57:03,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:03,981 INFO L93 Difference]: Finished difference Result 671 states and 937 transitions. [2024-11-07 02:57:03,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 02:57:03,982 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-07 02:57:03,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:03,983 INFO L225 Difference]: With dead ends: 671 [2024-11-07 02:57:03,983 INFO L226 Difference]: Without dead ends: 389 [2024-11-07 02:57:03,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2024-11-07 02:57:03,984 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 27 mSDsluCounter, 3960 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4127 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:03,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4127 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 02:57:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-07 02:57:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 387. [2024-11-07 02:57:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 1.3808290155440415) internal successors, (533), 386 states have internal predecessors, (533), 0 states have call successors, (0), 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-07 02:57:03,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 533 transitions. [2024-11-07 02:57:03,989 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 533 transitions. Word has length 90 [2024-11-07 02:57:03,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:03,989 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 533 transitions. [2024-11-07 02:57:03,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 26 states have internal predecessors, (90), 0 states have call successors, (0), 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-07 02:57:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 533 transitions. [2024-11-07 02:57:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 02:57:03,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:03,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:03,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 02:57:03,990 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:03,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:03,990 INFO L85 PathProgramCache]: Analyzing trace with hash -206039673, now seen corresponding path program 1 times [2024-11-07 02:57:03,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:03,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711347793] [2024-11-07 02:57:03,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:04,423 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-07 02:57:04,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711347793] [2024-11-07 02:57:04,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711347793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:04,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:04,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:57:04,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413863719] [2024-11-07 02:57:04,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:04,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:57:04,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:04,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:57:04,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:04,427 INFO L87 Difference]: Start difference. First operand 387 states and 533 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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-07 02:57:04,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:04,530 INFO L93 Difference]: Finished difference Result 705 states and 984 transitions. [2024-11-07 02:57:04,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:57:04,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-07 02:57:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:04,532 INFO L225 Difference]: With dead ends: 705 [2024-11-07 02:57:04,532 INFO L226 Difference]: Without dead ends: 402 [2024-11-07 02:57:04,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:04,536 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 3 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:04,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1452 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-07 02:57:04,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2024-11-07 02:57:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.3778337531486147) internal successors, (547), 397 states have internal predecessors, (547), 0 states have call successors, (0), 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-07 02:57:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 547 transitions. [2024-11-07 02:57:04,550 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 547 transitions. Word has length 90 [2024-11-07 02:57:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:04,550 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 547 transitions. [2024-11-07 02:57:04,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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-07 02:57:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 547 transitions. [2024-11-07 02:57:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 02:57:04,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:04,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:04,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 02:57:04,552 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:04,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:04,556 INFO L85 PathProgramCache]: Analyzing trace with hash -62625796, now seen corresponding path program 1 times [2024-11-07 02:57:04,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:04,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937991437] [2024-11-07 02:57:04,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:04,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:04,998 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-07 02:57:04,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:04,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937991437] [2024-11-07 02:57:05,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937991437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:05,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:05,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:57:05,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279914427] [2024-11-07 02:57:05,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:05,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:57:05,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:05,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:57:05,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:57:05,001 INFO L87 Difference]: Start difference. First operand 398 states and 547 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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-07 02:57:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:05,059 INFO L93 Difference]: Finished difference Result 811 states and 1126 transitions. [2024-11-07 02:57:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:57:05,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-11-07 02:57:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:05,061 INFO L225 Difference]: With dead ends: 811 [2024-11-07 02:57:05,061 INFO L226 Difference]: Without dead ends: 458 [2024-11-07 02:57:05,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:57:05,063 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 476 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:05,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 602 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-07 02:57:05,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 377. [2024-11-07 02:57:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.375) internal successors, (517), 376 states have internal predecessors, (517), 0 states have call successors, (0), 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-07 02:57:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 517 transitions. [2024-11-07 02:57:05,073 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 517 transitions. Word has length 90 [2024-11-07 02:57:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:05,074 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 517 transitions. [2024-11-07 02:57:05,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 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-07 02:57:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 517 transitions. [2024-11-07 02:57:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 02:57:05,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:05,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:05,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 02:57:05,075 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:05,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:05,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1289395484, now seen corresponding path program 1 times [2024-11-07 02:57:05,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:05,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575118996] [2024-11-07 02:57:05,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:05,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:05,648 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-07 02:57:05,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:05,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575118996] [2024-11-07 02:57:05,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575118996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:05,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:05,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:57:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964523270] [2024-11-07 02:57:05,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:05,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:57:05,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:05,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:57:05,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:57:05,649 INFO L87 Difference]: Start difference. First operand 377 states and 517 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 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-07 02:57:05,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:05,802 INFO L93 Difference]: Finished difference Result 766 states and 1068 transitions. [2024-11-07 02:57:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:57:05,803 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 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-07 02:57:05,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:05,804 INFO L225 Difference]: With dead ends: 766 [2024-11-07 02:57:05,804 INFO L226 Difference]: Without dead ends: 466 [2024-11-07 02:57:05,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:57:05,805 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 451 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:05,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1208 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-07 02:57:05,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 390. [2024-11-07 02:57:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.3753213367609254) internal successors, (535), 389 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 535 transitions. [2024-11-07 02:57:05,809 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 535 transitions. Word has length 91 [2024-11-07 02:57:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:05,809 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 535 transitions. [2024-11-07 02:57:05,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 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-07 02:57:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 535 transitions. [2024-11-07 02:57:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 02:57:05,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:05,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:05,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 02:57:05,810 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:05,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:05,811 INFO L85 PathProgramCache]: Analyzing trace with hash -871652867, now seen corresponding path program 1 times [2024-11-07 02:57:05,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:05,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127965298] [2024-11-07 02:57:05,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:05,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:06,098 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-07 02:57:06,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:06,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127965298] [2024-11-07 02:57:06,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127965298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:06,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:06,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:57:06,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191035266] [2024-11-07 02:57:06,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:06,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:57:06,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:06,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:57:06,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:06,100 INFO L87 Difference]: Start difference. First operand 390 states and 535 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-07 02:57:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:06,152 INFO L93 Difference]: Finished difference Result 703 states and 979 transitions. [2024-11-07 02:57:06,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:57:06,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-07 02:57:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:06,153 INFO L225 Difference]: With dead ends: 703 [2024-11-07 02:57:06,153 INFO L226 Difference]: Without dead ends: 403 [2024-11-07 02:57:06,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:06,154 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 4 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:06,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1467 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-07 02:57:06,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 396. [2024-11-07 02:57:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.3772151898734177) internal successors, (544), 395 states have internal predecessors, (544), 0 states have call successors, (0), 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-07 02:57:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 544 transitions. [2024-11-07 02:57:06,158 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 544 transitions. Word has length 91 [2024-11-07 02:57:06,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:06,158 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 544 transitions. [2024-11-07 02:57:06,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-07 02:57:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 544 transitions. [2024-11-07 02:57:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 02:57:06,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:06,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:06,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 02:57:06,159 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:06,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:06,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1621007207, now seen corresponding path program 1 times [2024-11-07 02:57:06,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:06,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292200883] [2024-11-07 02:57:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:06,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:07,178 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-07 02:57:07,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:07,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292200883] [2024-11-07 02:57:07,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292200883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:07,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:07,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2024-11-07 02:57:07,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989740528] [2024-11-07 02:57:07,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:07,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-07 02:57:07,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:07,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-07 02:57:07,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2024-11-07 02:57:07,180 INFO L87 Difference]: Start difference. First operand 396 states and 544 transitions. Second operand has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 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-07 02:57:07,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:07,971 INFO L93 Difference]: Finished difference Result 734 states and 1023 transitions. [2024-11-07 02:57:07,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-07 02:57:07,972 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 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-07 02:57:07,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:07,973 INFO L225 Difference]: With dead ends: 734 [2024-11-07 02:57:07,973 INFO L226 Difference]: Without dead ends: 416 [2024-11-07 02:57:07,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2024-11-07 02:57:07,974 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 32 mSDsluCounter, 4112 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4272 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:07,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4272 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 02:57:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-07 02:57:07,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 414. [2024-11-07 02:57:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.3777239709443099) internal successors, (569), 413 states have internal predecessors, (569), 0 states have call successors, (0), 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-07 02:57:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 569 transitions. [2024-11-07 02:57:07,979 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 569 transitions. Word has length 91 [2024-11-07 02:57:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:07,979 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 569 transitions. [2024-11-07 02:57:07,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.1379310344827585) internal successors, (91), 29 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-07 02:57:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 569 transitions. [2024-11-07 02:57:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 02:57:07,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:07,980 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:07,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 02:57:07,980 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:07,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:07,980 INFO L85 PathProgramCache]: Analyzing trace with hash -870296839, now seen corresponding path program 1 times [2024-11-07 02:57:07,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:07,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739195489] [2024-11-07 02:57:07,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:07,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:08,402 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-07 02:57:08,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:08,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739195489] [2024-11-07 02:57:08,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739195489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:08,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:08,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:57:08,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190040626] [2024-11-07 02:57:08,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:08,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:57:08,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:08,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:57:08,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:08,403 INFO L87 Difference]: Start difference. First operand 414 states and 569 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-07 02:57:08,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:08,479 INFO L93 Difference]: Finished difference Result 761 states and 1060 transitions. [2024-11-07 02:57:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:57:08,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-07 02:57:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:08,480 INFO L225 Difference]: With dead ends: 761 [2024-11-07 02:57:08,480 INFO L226 Difference]: Without dead ends: 429 [2024-11-07 02:57:08,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:08,481 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 3 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:08,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1452 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-07 02:57:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 425. [2024-11-07 02:57:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.375) internal successors, (583), 424 states have internal predecessors, (583), 0 states have call successors, (0), 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-07 02:57:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 583 transitions. [2024-11-07 02:57:08,487 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 583 transitions. Word has length 91 [2024-11-07 02:57:08,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:08,488 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 583 transitions. [2024-11-07 02:57:08,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-07 02:57:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 583 transitions. [2024-11-07 02:57:08,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 02:57:08,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:08,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:08,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 02:57:08,489 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:08,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:08,489 INFO L85 PathProgramCache]: Analyzing trace with hash -795233984, now seen corresponding path program 1 times [2024-11-07 02:57:08,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:08,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77997975] [2024-11-07 02:57:08,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:08,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:09,137 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-07 02:57:09,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:09,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77997975] [2024-11-07 02:57:09,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77997975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:09,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:09,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:57:09,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31933490] [2024-11-07 02:57:09,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:09,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:57:09,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:09,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:57:09,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:57:09,140 INFO L87 Difference]: Start difference. First operand 425 states and 583 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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-07 02:57:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:09,328 INFO L93 Difference]: Finished difference Result 834 states and 1161 transitions. [2024-11-07 02:57:09,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:57:09,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-07 02:57:09,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:09,331 INFO L225 Difference]: With dead ends: 834 [2024-11-07 02:57:09,331 INFO L226 Difference]: Without dead ends: 506 [2024-11-07 02:57:09,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:57:09,332 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 439 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:09,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1335 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-07 02:57:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 438. [2024-11-07 02:57:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 1.3752860411899313) internal successors, (601), 437 states have internal predecessors, (601), 0 states have call successors, (0), 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-07 02:57:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 601 transitions. [2024-11-07 02:57:09,338 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 601 transitions. Word has length 92 [2024-11-07 02:57:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:09,338 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 601 transitions. [2024-11-07 02:57:09,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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-07 02:57:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 601 transitions. [2024-11-07 02:57:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 02:57:09,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:09,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:09,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-07 02:57:09,340 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:09,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:09,340 INFO L85 PathProgramCache]: Analyzing trace with hash 941413749, now seen corresponding path program 1 times [2024-11-07 02:57:09,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:09,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901939549] [2024-11-07 02:57:09,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:09,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:10,636 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-07 02:57:10,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:10,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901939549] [2024-11-07 02:57:10,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901939549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:10,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:10,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2024-11-07 02:57:10,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518437731] [2024-11-07 02:57:10,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:10,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-07 02:57:10,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:10,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-07 02:57:10,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 02:57:10,638 INFO L87 Difference]: Start difference. First operand 438 states and 601 transitions. Second operand has 33 states, 33 states have (on average 2.787878787878788) internal successors, (92), 33 states have internal predecessors, (92), 0 states have call successors, (0), 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-07 02:57:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:11,608 INFO L93 Difference]: Finished difference Result 831 states and 1154 transitions. [2024-11-07 02:57:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-07 02:57:11,609 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.787878787878788) internal successors, (92), 33 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-07 02:57:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:11,611 INFO L225 Difference]: With dead ends: 831 [2024-11-07 02:57:11,611 INFO L226 Difference]: Without dead ends: 490 [2024-11-07 02:57:11,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=1054, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 02:57:11,612 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 39 mSDsluCounter, 5538 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 5726 SdHoareTripleChecker+Invalid, 2216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:11,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 5726 Invalid, 2216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 02:57:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-07 02:57:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 478. [2024-11-07 02:57:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.3773584905660377) internal successors, (657), 477 states have internal predecessors, (657), 0 states have call successors, (0), 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-07 02:57:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 657 transitions. [2024-11-07 02:57:11,619 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 657 transitions. Word has length 92 [2024-11-07 02:57:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:11,620 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 657 transitions. [2024-11-07 02:57:11,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.787878787878788) internal successors, (92), 33 states have internal predecessors, (92), 0 states have call successors, (0), 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-07 02:57:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 657 transitions. [2024-11-07 02:57:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 02:57:11,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:11,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:11,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-07 02:57:11,621 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:11,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1532097493, now seen corresponding path program 1 times [2024-11-07 02:57:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:11,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256373375] [2024-11-07 02:57:11,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:11,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:12,210 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-07 02:57:12,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:12,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256373375] [2024-11-07 02:57:12,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256373375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:12,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:12,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:57:12,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054467009] [2024-11-07 02:57:12,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:12,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:57:12,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:12,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:57:12,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:12,212 INFO L87 Difference]: Start difference. First operand 478 states and 657 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-07 02:57:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:12,282 INFO L93 Difference]: Finished difference Result 861 states and 1198 transitions. [2024-11-07 02:57:12,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:57:12,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-07 02:57:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:12,284 INFO L225 Difference]: With dead ends: 861 [2024-11-07 02:57:12,284 INFO L226 Difference]: Without dead ends: 488 [2024-11-07 02:57:12,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:12,285 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 3 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:12,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1460 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-07 02:57:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 480. [2024-11-07 02:57:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.3757828810020878) internal successors, (659), 479 states have internal predecessors, (659), 0 states have call successors, (0), 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-07 02:57:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 659 transitions. [2024-11-07 02:57:12,289 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 659 transitions. Word has length 92 [2024-11-07 02:57:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:12,289 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 659 transitions. [2024-11-07 02:57:12,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-07 02:57:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 659 transitions. [2024-11-07 02:57:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 02:57:12,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:12,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:12,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-07 02:57:12,290 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash -820081846, now seen corresponding path program 1 times [2024-11-07 02:57:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80112089] [2024-11-07 02:57:12,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:12,713 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-07 02:57:12,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:12,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80112089] [2024-11-07 02:57:12,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80112089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:12,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:12,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:57:12,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472991373] [2024-11-07 02:57:12,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:12,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:57:12,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:12,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:57:12,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:12,715 INFO L87 Difference]: Start difference. First operand 480 states and 659 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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-07 02:57:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:12,727 INFO L93 Difference]: Finished difference Result 876 states and 1218 transitions. [2024-11-07 02:57:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:57:12,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-11-07 02:57:12,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:12,729 INFO L225 Difference]: With dead ends: 876 [2024-11-07 02:57:12,729 INFO L226 Difference]: Without dead ends: 451 [2024-11-07 02:57:12,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:12,730 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:12,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 429 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-07 02:57:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 445. [2024-11-07 02:57:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.3716216216216217) internal successors, (609), 444 states have internal predecessors, (609), 0 states have call successors, (0), 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-07 02:57:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 609 transitions. [2024-11-07 02:57:12,736 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 609 transitions. Word has length 92 [2024-11-07 02:57:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:12,737 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 609 transitions. [2024-11-07 02:57:12,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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-07 02:57:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 609 transitions. [2024-11-07 02:57:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 02:57:12,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:12,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:12,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-07 02:57:12,738 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:12,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:12,738 INFO L85 PathProgramCache]: Analyzing trace with hash 732561522, now seen corresponding path program 1 times [2024-11-07 02:57:12,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:12,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785557001] [2024-11-07 02:57:12,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:12,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:13,527 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-07 02:57:13,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:13,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785557001] [2024-11-07 02:57:13,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785557001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:13,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:13,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:57:13,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288810799] [2024-11-07 02:57:13,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:13,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:57:13,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:13,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:57:13,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:57:13,528 INFO L87 Difference]: Start difference. First operand 445 states and 609 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:13,676 INFO L93 Difference]: Finished difference Result 833 states and 1159 transitions. [2024-11-07 02:57:13,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:57:13,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-07 02:57:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:13,678 INFO L225 Difference]: With dead ends: 833 [2024-11-07 02:57:13,678 INFO L226 Difference]: Without dead ends: 488 [2024-11-07 02:57:13,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:57:13,679 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 361 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:13,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1222 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-11-07 02:57:13,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 458. [2024-11-07 02:57:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.37417943107221) internal successors, (628), 457 states have internal predecessors, (628), 0 states have call successors, (0), 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-07 02:57:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 628 transitions. [2024-11-07 02:57:13,683 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 628 transitions. Word has length 93 [2024-11-07 02:57:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:13,683 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 628 transitions. [2024-11-07 02:57:13,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 628 transitions. [2024-11-07 02:57:13,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 02:57:13,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:13,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:13,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-07 02:57:13,684 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:13,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1603696857, now seen corresponding path program 1 times [2024-11-07 02:57:13,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:13,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769545290] [2024-11-07 02:57:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:13,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:15,037 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-07 02:57:15,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:15,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769545290] [2024-11-07 02:57:15,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769545290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:15,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:15,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2024-11-07 02:57:15,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491012314] [2024-11-07 02:57:15,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:15,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-07 02:57:15,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:15,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-07 02:57:15,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 02:57:15,039 INFO L87 Difference]: Start difference. First operand 458 states and 628 transitions. Second operand has 35 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:16,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:16,254 INFO L93 Difference]: Finished difference Result 850 states and 1184 transitions. [2024-11-07 02:57:16,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-07 02:57:16,255 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-07 02:57:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:16,256 INFO L225 Difference]: With dead ends: 850 [2024-11-07 02:57:16,256 INFO L226 Difference]: Without dead ends: 492 [2024-11-07 02:57:16,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 02:57:16,257 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 40 mSDsluCounter, 4550 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4694 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:16,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4694 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 02:57:16,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-07 02:57:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 490. [2024-11-07 02:57:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 1.3762781186094069) internal successors, (673), 489 states have internal predecessors, (673), 0 states have call successors, (0), 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-07 02:57:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 673 transitions. [2024-11-07 02:57:16,270 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 673 transitions. Word has length 93 [2024-11-07 02:57:16,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:16,270 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 673 transitions. [2024-11-07 02:57:16,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 673 transitions. [2024-11-07 02:57:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 02:57:16,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:16,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:16,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-07 02:57:16,271 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:16,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1286395271, now seen corresponding path program 1 times [2024-11-07 02:57:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:16,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426976853] [2024-11-07 02:57:16,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:16,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:16,939 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-07 02:57:16,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:16,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426976853] [2024-11-07 02:57:16,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426976853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:16,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:16,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:57:16,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013566046] [2024-11-07 02:57:16,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:16,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:57:16,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:16,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:57:16,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:16,944 INFO L87 Difference]: Start difference. First operand 490 states and 673 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:17,007 INFO L93 Difference]: Finished difference Result 891 states and 1241 transitions. [2024-11-07 02:57:17,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:57:17,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-07 02:57:17,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:17,009 INFO L225 Difference]: With dead ends: 891 [2024-11-07 02:57:17,009 INFO L226 Difference]: Without dead ends: 505 [2024-11-07 02:57:17,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:57:17,011 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 3 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:17,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1233 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-07 02:57:17,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 501. [2024-11-07 02:57:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 1.374) internal successors, (687), 500 states have internal predecessors, (687), 0 states have call successors, (0), 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-07 02:57:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 687 transitions. [2024-11-07 02:57:17,019 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 687 transitions. Word has length 93 [2024-11-07 02:57:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:17,021 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 687 transitions. [2024-11-07 02:57:17,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 687 transitions. [2024-11-07 02:57:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 02:57:17,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:17,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:17,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-07 02:57:17,023 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:17,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:17,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1839786176, now seen corresponding path program 1 times [2024-11-07 02:57:17,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:17,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744766137] [2024-11-07 02:57:17,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:17,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:17,516 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-07 02:57:17,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:17,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744766137] [2024-11-07 02:57:17,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744766137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:17,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:17,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:57:17,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454729003] [2024-11-07 02:57:17,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:17,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:57:17,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:17,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:57:17,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:57:17,519 INFO L87 Difference]: Start difference. First operand 501 states and 687 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:17,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:17,597 INFO L93 Difference]: Finished difference Result 980 states and 1360 transitions. [2024-11-07 02:57:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:57:17,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-07 02:57:17,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:17,599 INFO L225 Difference]: With dead ends: 980 [2024-11-07 02:57:17,600 INFO L226 Difference]: Without dead ends: 552 [2024-11-07 02:57:17,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:57:17,601 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 412 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:17,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 596 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-07 02:57:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 495. [2024-11-07 02:57:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 1.3704453441295548) internal successors, (677), 494 states have internal predecessors, (677), 0 states have call successors, (0), 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-07 02:57:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 677 transitions. [2024-11-07 02:57:17,609 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 677 transitions. Word has length 93 [2024-11-07 02:57:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:17,609 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 677 transitions. [2024-11-07 02:57:17,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 677 transitions. [2024-11-07 02:57:17,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 02:57:17,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:17,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:17,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-07 02:57:17,610 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:17,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:17,611 INFO L85 PathProgramCache]: Analyzing trace with hash 150040444, now seen corresponding path program 1 times [2024-11-07 02:57:17,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:17,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679696169] [2024-11-07 02:57:17,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:17,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:18,099 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-07 02:57:18,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:18,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679696169] [2024-11-07 02:57:18,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679696169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:18,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:18,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:57:18,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335001885] [2024-11-07 02:57:18,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:18,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:57:18,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:18,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:57:18,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:18,101 INFO L87 Difference]: Start difference. First operand 495 states and 677 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:18,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:18,115 INFO L93 Difference]: Finished difference Result 899 states and 1247 transitions. [2024-11-07 02:57:18,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:57:18,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2024-11-07 02:57:18,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:18,117 INFO L225 Difference]: With dead ends: 899 [2024-11-07 02:57:18,117 INFO L226 Difference]: Without dead ends: 464 [2024-11-07 02:57:18,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:18,118 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:18,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 636 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-07 02:57:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 458. [2024-11-07 02:57:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.3676148796498906) internal successors, (625), 457 states have internal predecessors, (625), 0 states have call successors, (0), 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-07 02:57:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 625 transitions. [2024-11-07 02:57:18,130 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 625 transitions. Word has length 93 [2024-11-07 02:57:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:18,130 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 625 transitions. [2024-11-07 02:57:18,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 625 transitions. [2024-11-07 02:57:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 02:57:18,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:18,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:18,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-07 02:57:18,131 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:18,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:18,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1300215773, now seen corresponding path program 1 times [2024-11-07 02:57:18,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:18,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089227791] [2024-11-07 02:57:18,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:18,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:18,604 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-07 02:57:18,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:18,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089227791] [2024-11-07 02:57:18,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089227791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:18,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:18,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:57:18,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702227587] [2024-11-07 02:57:18,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:18,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:57:18,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:18,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:57:18,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:18,605 INFO L87 Difference]: Start difference. First operand 458 states and 625 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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-07 02:57:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:18,616 INFO L93 Difference]: Finished difference Result 830 states and 1151 transitions. [2024-11-07 02:57:18,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:57:18,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 02:57:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:18,617 INFO L225 Difference]: With dead ends: 830 [2024-11-07 02:57:18,617 INFO L226 Difference]: Without dead ends: 455 [2024-11-07 02:57:18,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:18,618 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:18,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 630 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-07 02:57:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2024-11-07 02:57:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 1.3634361233480177) internal successors, (619), 454 states have internal predecessors, (619), 0 states have call successors, (0), 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-07 02:57:18,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 619 transitions. [2024-11-07 02:57:18,622 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 619 transitions. Word has length 94 [2024-11-07 02:57:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:18,622 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 619 transitions. [2024-11-07 02:57:18,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 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-07 02:57:18,623 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 619 transitions. [2024-11-07 02:57:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 02:57:18,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:18,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:18,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-07 02:57:18,623 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:18,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash -33185650, now seen corresponding path program 1 times [2024-11-07 02:57:18,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:18,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034764035] [2024-11-07 02:57:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:18,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:19,257 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-07 02:57:19,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:19,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034764035] [2024-11-07 02:57:19,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034764035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:19,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:19,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:57:19,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403186193] [2024-11-07 02:57:19,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:19,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:57:19,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:19,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:57:19,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:57:19,259 INFO L87 Difference]: Start difference. First operand 455 states and 619 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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-07 02:57:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:19,427 INFO L93 Difference]: Finished difference Result 854 states and 1183 transitions. [2024-11-07 02:57:19,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:57:19,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 02:57:19,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:19,429 INFO L225 Difference]: With dead ends: 854 [2024-11-07 02:57:19,429 INFO L226 Difference]: Without dead ends: 490 [2024-11-07 02:57:19,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:57:19,430 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 313 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:19,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1186 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-07 02:57:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 468. [2024-11-07 02:57:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.3640256959314776) internal successors, (637), 467 states have internal predecessors, (637), 0 states have call successors, (0), 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-07 02:57:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 637 transitions. [2024-11-07 02:57:19,436 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 637 transitions. Word has length 94 [2024-11-07 02:57:19,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:19,436 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 637 transitions. [2024-11-07 02:57:19,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 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-07 02:57:19,436 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 637 transitions. [2024-11-07 02:57:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 02:57:19,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:19,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:19,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-07 02:57:19,437 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:19,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash -560543293, now seen corresponding path program 1 times [2024-11-07 02:57:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:19,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378704552] [2024-11-07 02:57:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:19,985 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-07 02:57:19,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:19,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378704552] [2024-11-07 02:57:19,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378704552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:19,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:19,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 02:57:19,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492003810] [2024-11-07 02:57:19,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:19,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 02:57:19,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:19,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 02:57:19,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 02:57:19,987 INFO L87 Difference]: Start difference. First operand 468 states and 637 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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-07 02:57:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:20,088 INFO L93 Difference]: Finished difference Result 860 states and 1189 transitions. [2024-11-07 02:57:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 02:57:20,089 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-11-07 02:57:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:20,091 INFO L225 Difference]: With dead ends: 860 [2024-11-07 02:57:20,091 INFO L226 Difference]: Without dead ends: 483 [2024-11-07 02:57:20,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 02:57:20,092 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 5 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:20,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1783 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:20,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-07 02:57:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 482. [2024-11-07 02:57:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.3617463617463617) internal successors, (655), 481 states have internal predecessors, (655), 0 states have call successors, (0), 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-07 02:57:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 655 transitions. [2024-11-07 02:57:20,098 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 655 transitions. Word has length 94 [2024-11-07 02:57:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:20,099 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 655 transitions. [2024-11-07 02:57:20,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 0 states have call successors, (0), 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-07 02:57:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 655 transitions. [2024-11-07 02:57:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 02:57:20,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:20,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:20,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-07 02:57:20,100 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:20,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1910848512, now seen corresponding path program 1 times [2024-11-07 02:57:20,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:20,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072056148] [2024-11-07 02:57:20,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:20,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:20,843 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-07 02:57:20,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:20,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072056148] [2024-11-07 02:57:20,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072056148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:20,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:20,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:57:20,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029536102] [2024-11-07 02:57:20,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:20,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:57:20,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:20,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:57:20,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:57:20,845 INFO L87 Difference]: Start difference. First operand 482 states and 655 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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-07 02:57:21,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:21,014 INFO L93 Difference]: Finished difference Result 882 states and 1220 transitions. [2024-11-07 02:57:21,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:57:21,015 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-07 02:57:21,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:21,016 INFO L225 Difference]: With dead ends: 882 [2024-11-07 02:57:21,016 INFO L226 Difference]: Without dead ends: 509 [2024-11-07 02:57:21,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:57:21,017 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 303 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:21,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1187 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-07 02:57:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 495. [2024-11-07 02:57:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 1.3623481781376519) internal successors, (673), 494 states have internal predecessors, (673), 0 states have call successors, (0), 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-07 02:57:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 673 transitions. [2024-11-07 02:57:21,022 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 673 transitions. Word has length 95 [2024-11-07 02:57:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:21,022 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 673 transitions. [2024-11-07 02:57:21,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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-07 02:57:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 673 transitions. [2024-11-07 02:57:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 02:57:21,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:21,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:21,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-07 02:57:21,023 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:21,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:21,024 INFO L85 PathProgramCache]: Analyzing trace with hash -564163285, now seen corresponding path program 1 times [2024-11-07 02:57:21,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:21,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702548695] [2024-11-07 02:57:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:21,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:21,166 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-07 02:57:21,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:21,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702548695] [2024-11-07 02:57:21,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702548695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:21,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:21,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:57:21,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416800858] [2024-11-07 02:57:21,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:21,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:57:21,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:21,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:57:21,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:21,168 INFO L87 Difference]: Start difference. First operand 495 states and 673 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-07 02:57:21,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:21,183 INFO L93 Difference]: Finished difference Result 870 states and 1202 transitions. [2024-11-07 02:57:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:57:21,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-07 02:57:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:21,185 INFO L225 Difference]: With dead ends: 870 [2024-11-07 02:57:21,185 INFO L226 Difference]: Without dead ends: 497 [2024-11-07 02:57:21,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:21,186 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:21,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 629 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-07 02:57:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2024-11-07 02:57:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.3608870967741935) internal successors, (675), 496 states have internal predecessors, (675), 0 states have call successors, (0), 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-07 02:57:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 675 transitions. [2024-11-07 02:57:21,191 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 675 transitions. Word has length 95 [2024-11-07 02:57:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:21,192 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 675 transitions. [2024-11-07 02:57:21,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-07 02:57:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 675 transitions. [2024-11-07 02:57:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 02:57:21,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:21,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:21,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-07 02:57:21,193 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:21,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:21,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1437781941, now seen corresponding path program 1 times [2024-11-07 02:57:21,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:21,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166464802] [2024-11-07 02:57:21,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:21,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:23,974 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-07 02:57:23,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:23,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166464802] [2024-11-07 02:57:23,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166464802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:23,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:23,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2024-11-07 02:57:23,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290984546] [2024-11-07 02:57:23,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:23,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-07 02:57:23,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:23,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-07 02:57:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1732, Unknown=0, NotChecked=0, Total=1892 [2024-11-07 02:57:23,977 INFO L87 Difference]: Start difference. First operand 497 states and 675 transitions. Second operand has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 44 states have internal predecessors, (95), 0 states have call successors, (0), 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-07 02:57:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:25,067 INFO L93 Difference]: Finished difference Result 947 states and 1304 transitions. [2024-11-07 02:57:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-07 02:57:25,068 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 44 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-07 02:57:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:25,069 INFO L225 Difference]: With dead ends: 947 [2024-11-07 02:57:25,069 INFO L226 Difference]: Without dead ends: 547 [2024-11-07 02:57:25,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=182, Invalid=2074, Unknown=0, NotChecked=0, Total=2256 [2024-11-07 02:57:25,071 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 377 mSDsluCounter, 5811 mSDsCounter, 0 mSdLazyCounter, 2447 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 5966 SdHoareTripleChecker+Invalid, 2448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:25,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 5966 Invalid, 2448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2447 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 02:57:25,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-07 02:57:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 503. [2024-11-07 02:57:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 502 states have (on average 1.3585657370517927) internal successors, (682), 502 states have internal predecessors, (682), 0 states have call successors, (0), 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-07 02:57:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 682 transitions. [2024-11-07 02:57:25,076 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 682 transitions. Word has length 95 [2024-11-07 02:57:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:25,076 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 682 transitions. [2024-11-07 02:57:25,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.159090909090909) internal successors, (95), 44 states have internal predecessors, (95), 0 states have call successors, (0), 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-07 02:57:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 682 transitions. [2024-11-07 02:57:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-07 02:57:25,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:25,077 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:25,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-07 02:57:25,077 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:25,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:25,077 INFO L85 PathProgramCache]: Analyzing trace with hash -169943798, now seen corresponding path program 1 times [2024-11-07 02:57:25,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:25,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016819716] [2024-11-07 02:57:25,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:25,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:25,413 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-07 02:57:25,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:25,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016819716] [2024-11-07 02:57:25,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016819716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:25,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:25,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:57:25,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558426804] [2024-11-07 02:57:25,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:25,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:57:25,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:25,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:57:25,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:25,416 INFO L87 Difference]: Start difference. First operand 503 states and 682 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-07 02:57:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:25,426 INFO L93 Difference]: Finished difference Result 893 states and 1229 transitions. [2024-11-07 02:57:25,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:57:25,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-11-07 02:57:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:25,427 INFO L225 Difference]: With dead ends: 893 [2024-11-07 02:57:25,427 INFO L226 Difference]: Without dead ends: 465 [2024-11-07 02:57:25,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:25,429 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 0 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:25,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 624 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:57:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-07 02:57:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 460. [2024-11-07 02:57:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.3529411764705883) internal successors, (621), 459 states have internal predecessors, (621), 0 states have call successors, (0), 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-07 02:57:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 621 transitions. [2024-11-07 02:57:25,433 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 621 transitions. Word has length 95 [2024-11-07 02:57:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:25,433 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 621 transitions. [2024-11-07 02:57:25,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-07 02:57:25,433 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 621 transitions. [2024-11-07 02:57:25,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 02:57:25,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:25,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:25,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-07 02:57:25,434 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:25,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:25,435 INFO L85 PathProgramCache]: Analyzing trace with hash -751499812, now seen corresponding path program 1 times [2024-11-07 02:57:25,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:25,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219971741] [2024-11-07 02:57:25,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:25,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:26,001 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-07 02:57:26,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:26,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219971741] [2024-11-07 02:57:26,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219971741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:26,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:26,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:57:26,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958287579] [2024-11-07 02:57:26,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:26,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:57:26,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:26,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:57:26,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:57:26,003 INFO L87 Difference]: Start difference. First operand 460 states and 621 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:26,136 INFO L93 Difference]: Finished difference Result 845 states and 1163 transitions. [2024-11-07 02:57:26,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:57:26,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-07 02:57:26,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:26,137 INFO L225 Difference]: With dead ends: 845 [2024-11-07 02:57:26,137 INFO L226 Difference]: Without dead ends: 479 [2024-11-07 02:57:26,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:57:26,138 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 245 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:26,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1156 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-07 02:57:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 473. [2024-11-07 02:57:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.353813559322034) internal successors, (639), 472 states have internal predecessors, (639), 0 states have call successors, (0), 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-07 02:57:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 639 transitions. [2024-11-07 02:57:26,142 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 639 transitions. Word has length 96 [2024-11-07 02:57:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:26,143 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 639 transitions. [2024-11-07 02:57:26,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 639 transitions. [2024-11-07 02:57:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 02:57:26,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:26,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:26,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-07 02:57:26,144 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:26,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:26,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1407158112, now seen corresponding path program 1 times [2024-11-07 02:57:26,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:26,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202878260] [2024-11-07 02:57:26,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:26,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:28,287 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-07 02:57:28,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:28,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202878260] [2024-11-07 02:57:28,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202878260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:28,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:28,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2024-11-07 02:57:28,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117686429] [2024-11-07 02:57:28,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:28,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-07 02:57:28,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:28,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-07 02:57:28,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2503, Unknown=0, NotChecked=0, Total=2652 [2024-11-07 02:57:28,289 INFO L87 Difference]: Start difference. First operand 473 states and 639 transitions. Second operand has 52 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 52 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:30,593 INFO L93 Difference]: Finished difference Result 892 states and 1232 transitions. [2024-11-07 02:57:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-07 02:57:30,593 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 52 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-07 02:57:30,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:30,595 INFO L225 Difference]: With dead ends: 892 [2024-11-07 02:57:30,595 INFO L226 Difference]: Without dead ends: 526 [2024-11-07 02:57:30,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=154, Invalid=2602, Unknown=0, NotChecked=0, Total=2756 [2024-11-07 02:57:30,596 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 336 mSDsluCounter, 4828 mSDsCounter, 0 mSdLazyCounter, 5669 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 4929 SdHoareTripleChecker+Invalid, 5715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 5669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:30,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 4929 Invalid, 5715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 5669 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 02:57:30,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-07 02:57:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 522. [2024-11-07 02:57:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 1.36468330134357) internal successors, (711), 521 states have internal predecessors, (711), 0 states have call successors, (0), 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-07 02:57:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 711 transitions. [2024-11-07 02:57:30,600 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 711 transitions. Word has length 96 [2024-11-07 02:57:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:30,600 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 711 transitions. [2024-11-07 02:57:30,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 52 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 711 transitions. [2024-11-07 02:57:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 02:57:30,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:30,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:30,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-07 02:57:30,601 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:30,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:30,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1772696593, now seen corresponding path program 1 times [2024-11-07 02:57:30,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:30,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884477425] [2024-11-07 02:57:30,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:30,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:32,280 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-07 02:57:32,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:32,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884477425] [2024-11-07 02:57:32,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884477425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:32,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:32,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2024-11-07 02:57:32,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849546666] [2024-11-07 02:57:32,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:32,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-07 02:57:32,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:32,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-07 02:57:32,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2024-11-07 02:57:32,282 INFO L87 Difference]: Start difference. First operand 522 states and 711 transitions. Second operand has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:34,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:34,222 INFO L93 Difference]: Finished difference Result 954 states and 1323 transitions. [2024-11-07 02:57:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-07 02:57:34,222 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-07 02:57:34,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:34,224 INFO L225 Difference]: With dead ends: 954 [2024-11-07 02:57:34,224 INFO L226 Difference]: Without dead ends: 526 [2024-11-07 02:57:34,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=1806, Unknown=0, NotChecked=0, Total=1892 [2024-11-07 02:57:34,225 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 49 mSDsluCounter, 4836 mSDsCounter, 0 mSdLazyCounter, 4234 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 4953 SdHoareTripleChecker+Invalid, 4270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:34,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 4953 Invalid, 4270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4234 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 02:57:34,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-07 02:57:34,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-11-07 02:57:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.3638095238095238) internal successors, (716), 525 states have internal predecessors, (716), 0 states have call successors, (0), 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-07 02:57:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 716 transitions. [2024-11-07 02:57:34,236 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 716 transitions. Word has length 96 [2024-11-07 02:57:34,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:34,236 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 716 transitions. [2024-11-07 02:57:34,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 44 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:34,236 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 716 transitions. [2024-11-07 02:57:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-07 02:57:34,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:34,237 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:34,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-07 02:57:34,237 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:34,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:34,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1733881231, now seen corresponding path program 1 times [2024-11-07 02:57:34,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:34,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073248212] [2024-11-07 02:57:34,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:34,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:34,875 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-07 02:57:34,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:34,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073248212] [2024-11-07 02:57:34,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073248212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:34,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:34,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:57:34,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810870738] [2024-11-07 02:57:34,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:34,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:57:34,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:34,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:57:34,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:57:34,877 INFO L87 Difference]: Start difference. First operand 526 states and 716 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:34,952 INFO L93 Difference]: Finished difference Result 972 states and 1348 transitions. [2024-11-07 02:57:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:57:34,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-07 02:57:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:34,955 INFO L225 Difference]: With dead ends: 972 [2024-11-07 02:57:34,955 INFO L226 Difference]: Without dead ends: 542 [2024-11-07 02:57:34,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:57:34,956 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 3 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:34,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1197 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:34,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-07 02:57:34,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 538. [2024-11-07 02:57:34,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.361266294227188) internal successors, (731), 537 states have internal predecessors, (731), 0 states have call successors, (0), 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-07 02:57:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 731 transitions. [2024-11-07 02:57:34,962 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 731 transitions. Word has length 96 [2024-11-07 02:57:34,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:34,962 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 731 transitions. [2024-11-07 02:57:34,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:57:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 731 transitions. [2024-11-07 02:57:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 02:57:34,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:34,963 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:34,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-07 02:57:34,963 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:34,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:34,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1056259651, now seen corresponding path program 1 times [2024-11-07 02:57:34,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:34,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002210615] [2024-11-07 02:57:34,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:34,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:35,655 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-07 02:57:35,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:57:35,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002210615] [2024-11-07 02:57:35,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002210615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:35,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:35,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 02:57:35,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670654432] [2024-11-07 02:57:35,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:35,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 02:57:35,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:57:35,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 02:57:35,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 02:57:35,657 INFO L87 Difference]: Start difference. First operand 538 states and 731 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 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-07 02:57:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:35,772 INFO L93 Difference]: Finished difference Result 993 states and 1375 transitions. [2024-11-07 02:57:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 02:57:35,773 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-07 02:57:35,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:35,774 INFO L225 Difference]: With dead ends: 993 [2024-11-07 02:57:35,774 INFO L226 Difference]: Without dead ends: 563 [2024-11-07 02:57:35,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-07 02:57:35,775 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 5 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:35,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1738 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-07 02:57:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 557. [2024-11-07 02:57:35,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 1.3615107913669064) internal successors, (757), 556 states have internal predecessors, (757), 0 states have call successors, (0), 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-07 02:57:35,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 757 transitions. [2024-11-07 02:57:35,787 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 757 transitions. Word has length 97 [2024-11-07 02:57:35,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:35,787 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 757 transitions. [2024-11-07 02:57:35,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 0 states have call successors, (0), 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-07 02:57:35,787 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 757 transitions. [2024-11-07 02:57:35,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-07 02:57:35,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:35,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:35,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-07 02:57:35,788 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:35,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:35,788 INFO L85 PathProgramCache]: Analyzing trace with hash 892317070, now seen corresponding path program 1 times [2024-11-07 02:57:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:57:35,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315797805] [2024-11-07 02:57:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:35,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:57:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:57:36,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 02:57:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:57:36,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 02:57:36,259 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 02:57:36,260 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 02:57:36,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-07 02:57:36,263 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:36,318 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 02:57:36,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:57:36 BoogieIcfgContainer [2024-11-07 02:57:36,321 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 02:57:36,322 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 02:57:36,322 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 02:57:36,322 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 02:57:36,323 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:56:36" (3/4) ... [2024-11-07 02:57:36,324 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 02:57:36,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 02:57:36,325 INFO L158 Benchmark]: Toolchain (without parser) took 61639.39ms. Allocated memory was 100.7MB in the beginning and 838.9MB in the end (delta: 738.2MB). Free memory was 76.0MB in the beginning and 738.1MB in the end (delta: -662.1MB). Peak memory consumption was 75.1MB. Max. memory is 16.1GB. [2024-11-07 02:57:36,325 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:57:36,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.32ms. Allocated memory is still 100.7MB. Free memory was 76.0MB in the beginning and 57.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:57:36,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.15ms. Allocated memory is still 100.7MB. Free memory was 57.9MB in the beginning and 44.5MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:57:36,326 INFO L158 Benchmark]: Boogie Preprocessor took 155.31ms. Allocated memory is still 100.7MB. Free memory was 44.5MB in the beginning and 68.2MB in the end (delta: -23.7MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-11-07 02:57:36,328 INFO L158 Benchmark]: RCFGBuilder took 980.92ms. Allocated memory is still 100.7MB. Free memory was 68.2MB in the beginning and 37.0MB in the end (delta: 31.2MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2024-11-07 02:57:36,328 INFO L158 Benchmark]: TraceAbstraction took 60052.37ms. Allocated memory was 100.7MB in the beginning and 838.9MB in the end (delta: 738.2MB). Free memory was 36.4MB in the beginning and 738.1MB in the end (delta: -701.7MB). Peak memory consumption was 483.1MB. Max. memory is 16.1GB. [2024-11-07 02:57:36,328 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 838.9MB. Free memory was 738.1MB in the beginning and 738.1MB in the end (delta: 61.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:57:36,329 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.23ms. Allocated memory is still 83.9MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.32ms. Allocated memory is still 100.7MB. Free memory was 76.0MB in the beginning and 57.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.15ms. Allocated memory is still 100.7MB. Free memory was 57.9MB in the beginning and 44.5MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 155.31ms. Allocated memory is still 100.7MB. Free memory was 44.5MB in the beginning and 68.2MB in the end (delta: -23.7MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * RCFGBuilder took 980.92ms. Allocated memory is still 100.7MB. Free memory was 68.2MB in the beginning and 37.0MB in the end (delta: 31.2MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * TraceAbstraction took 60052.37ms. Allocated memory was 100.7MB in the beginning and 838.9MB in the end (delta: 738.2MB). Free memory was 36.4MB in the beginning and 738.1MB in the end (delta: -701.7MB). Peak memory consumption was 483.1MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 838.9MB. Free memory was 738.1MB in the beginning and 738.1MB in the end (delta: 61.2kB). There was no memory consumed. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 248. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 2); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (2 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_1 var_78 = 1; [L35] SORT_1 input_2; [L37] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L37] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L38] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L38] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=3, var_4=0, var_78=1] [L39] SORT_3 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, var_4=0, var_78=1] [L40] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_9_arg_1 = var_4; [L45] state_8 = init_9_arg_1 [L46] SORT_3 init_26_arg_1 = var_4; [L47] state_25 = init_26_arg_1 [L48] SORT_3 init_44_arg_1 = var_4; [L49] state_43 = init_44_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L52] input_2 = __VERIFIER_nondet_uchar() [L55] SORT_3 var_7_arg_0 = state_5; [L56] SORT_3 var_7_arg_1 = var_4; [L57] SORT_1 var_7 = var_7_arg_0 != var_7_arg_1; [L58] SORT_3 var_10_arg_0 = state_8; [L59] SORT_3 var_10_arg_1 = var_4; [L60] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L61] SORT_1 var_11_arg_0 = var_7; [L62] SORT_1 var_11_arg_1 = var_10; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11_arg_0=0, var_11_arg_1=1, var_4=0, var_78=1] [L63] EXPR var_11_arg_0 | var_11_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L63] SORT_1 var_11 = var_11_arg_0 | var_11_arg_1; [L64] SORT_3 var_12_arg_0 = state_5; [L65] SORT_3 var_12_arg_1 = var_4; [L66] SORT_1 var_12 = var_12_arg_0 != var_12_arg_1; [L67] SORT_3 var_13_arg_0 = state_8; [L68] SORT_3 var_13_arg_1 = var_4; [L69] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L70] SORT_1 var_14_arg_0 = var_12; [L71] SORT_1 var_14_arg_1 = var_13; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11=1, var_14_arg_0=0, var_14_arg_1=1, var_4=0, var_78=1] [L72] EXPR var_14_arg_0 | var_14_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_11=1, var_4=0, var_78=1] [L72] SORT_1 var_14 = var_14_arg_0 | var_14_arg_1; [L73] SORT_1 var_15_arg_0 = var_11; [L74] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15_arg_0=1, var_15_arg_1=1, var_4=0, var_78=1] [L75] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L75] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L76] SORT_3 var_16_arg_0 = state_5; [L77] SORT_3 var_16_arg_1 = var_4; [L78] SORT_1 var_16 = var_16_arg_0 != var_16_arg_1; [L79] SORT_3 var_17_arg_0 = state_8; [L80] SORT_3 var_17_arg_1 = var_4; [L81] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L82] SORT_1 var_18_arg_0 = var_16; [L83] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15=1, var_18_arg_0=0, var_18_arg_1=1, var_4=0, var_78=1] [L84] EXPR var_18_arg_0 | var_18_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_15=1, var_4=0, var_78=1] [L84] SORT_1 var_18 = var_18_arg_0 | var_18_arg_1; [L85] SORT_1 var_19_arg_0 = var_15; [L86] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19_arg_0=1, var_19_arg_1=1, var_4=0, var_78=1] [L87] EXPR var_19_arg_0 & var_19_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L87] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L88] SORT_3 var_20_arg_0 = state_5; [L89] SORT_3 var_20_arg_1 = var_4; [L90] SORT_1 var_20 = var_20_arg_0 != var_20_arg_1; [L91] SORT_3 var_21_arg_0 = state_8; [L92] SORT_3 var_21_arg_1 = var_4; [L93] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L94] SORT_1 var_22_arg_0 = var_20; [L95] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19=1, var_22_arg_0=0, var_22_arg_1=1, var_4=0, var_78=1] [L96] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_19=1, var_4=0, var_78=1] [L96] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L97] SORT_1 var_23_arg_0 = var_19; [L98] SORT_1 var_23_arg_1 = var_22; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23_arg_0=1, var_23_arg_1=1, var_4=0, var_78=1] [L99] EXPR var_23_arg_0 & var_23_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L99] SORT_1 var_23 = var_23_arg_0 & var_23_arg_1; [L100] SORT_3 var_24_arg_0 = state_8; [L101] SORT_3 var_24_arg_1 = var_4; [L102] SORT_1 var_24 = var_24_arg_0 != var_24_arg_1; [L103] SORT_3 var_27_arg_0 = state_25; [L104] SORT_3 var_27_arg_1 = var_4; [L105] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L106] SORT_1 var_28_arg_0 = var_24; [L107] SORT_1 var_28_arg_1 = var_27; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23=1, var_28_arg_0=0, var_28_arg_1=1, var_4=0, var_78=1] [L108] EXPR var_28_arg_0 | var_28_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_23=1, var_4=0, var_78=1] [L108] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L109] SORT_1 var_29_arg_0 = var_23; [L110] SORT_1 var_29_arg_1 = var_28; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29_arg_0=1, var_29_arg_1=1, var_4=0, var_78=1] [L111] EXPR var_29_arg_0 & var_29_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L111] SORT_1 var_29 = var_29_arg_0 & var_29_arg_1; [L112] SORT_3 var_30_arg_0 = state_8; [L113] SORT_3 var_30_arg_1 = var_4; [L114] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L115] SORT_3 var_31_arg_0 = state_25; [L116] SORT_3 var_31_arg_1 = var_4; [L117] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L118] SORT_1 var_32_arg_0 = var_30; [L119] SORT_1 var_32_arg_1 = var_31; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29=1, var_32_arg_0=0, var_32_arg_1=1, var_4=0, var_78=1] [L120] EXPR var_32_arg_0 | var_32_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_29=1, var_4=0, var_78=1] [L120] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L121] SORT_1 var_33_arg_0 = var_29; [L122] SORT_1 var_33_arg_1 = var_32; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33_arg_0=1, var_33_arg_1=1, var_4=0, var_78=1] [L123] EXPR var_33_arg_0 & var_33_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L123] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L124] SORT_3 var_34_arg_0 = state_8; [L125] SORT_3 var_34_arg_1 = var_4; [L126] SORT_1 var_34 = var_34_arg_0 != var_34_arg_1; [L127] SORT_3 var_35_arg_0 = state_25; [L128] SORT_3 var_35_arg_1 = var_4; [L129] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L130] SORT_1 var_36_arg_0 = var_34; [L131] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33=1, var_36_arg_0=0, var_36_arg_1=1, var_4=0, var_78=1] [L132] EXPR var_36_arg_0 | var_36_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_33=1, var_4=0, var_78=1] [L132] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L133] SORT_1 var_37_arg_0 = var_33; [L134] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37_arg_0=1, var_37_arg_1=1, var_4=0, var_78=1] [L135] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L135] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L136] SORT_3 var_38_arg_0 = state_8; [L137] SORT_3 var_38_arg_1 = var_4; [L138] SORT_1 var_38 = var_38_arg_0 != var_38_arg_1; [L139] SORT_3 var_39_arg_0 = state_25; [L140] SORT_3 var_39_arg_1 = var_4; [L141] SORT_1 var_39 = var_39_arg_0 == var_39_arg_1; [L142] SORT_1 var_40_arg_0 = var_38; [L143] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37=1, var_40_arg_0=0, var_40_arg_1=1, var_4=0, var_78=1] [L144] EXPR var_40_arg_0 | var_40_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_37=1, var_4=0, var_78=1] [L144] SORT_1 var_40 = var_40_arg_0 | var_40_arg_1; [L145] SORT_1 var_41_arg_0 = var_37; [L146] SORT_1 var_41_arg_1 = var_40; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41_arg_0=1, var_41_arg_1=1, var_4=0, var_78=1] [L147] EXPR var_41_arg_0 & var_41_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L147] SORT_1 var_41 = var_41_arg_0 & var_41_arg_1; [L148] SORT_3 var_42_arg_0 = state_25; [L149] SORT_3 var_42_arg_1 = var_4; [L150] SORT_1 var_42 = var_42_arg_0 != var_42_arg_1; [L151] SORT_3 var_45_arg_0 = state_43; [L152] SORT_3 var_45_arg_1 = var_4; [L153] SORT_1 var_45 = var_45_arg_0 == var_45_arg_1; [L154] SORT_1 var_46_arg_0 = var_42; [L155] SORT_1 var_46_arg_1 = var_45; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41=1, var_46_arg_0=0, var_46_arg_1=1, var_4=0, var_78=1] [L156] EXPR var_46_arg_0 | var_46_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_41=1, var_4=0, var_78=1] [L156] SORT_1 var_46 = var_46_arg_0 | var_46_arg_1; [L157] SORT_1 var_47_arg_0 = var_41; [L158] SORT_1 var_47_arg_1 = var_46; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47_arg_0=1, var_47_arg_1=1, var_4=0, var_78=1] [L159] EXPR var_47_arg_0 & var_47_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L159] SORT_1 var_47 = var_47_arg_0 & var_47_arg_1; [L160] SORT_3 var_48_arg_0 = state_25; [L161] SORT_3 var_48_arg_1 = var_4; [L162] SORT_1 var_48 = var_48_arg_0 != var_48_arg_1; [L163] SORT_3 var_49_arg_0 = state_43; [L164] SORT_3 var_49_arg_1 = var_4; [L165] SORT_1 var_49 = var_49_arg_0 == var_49_arg_1; [L166] SORT_1 var_50_arg_0 = var_48; [L167] SORT_1 var_50_arg_1 = var_49; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47=1, var_4=0, var_50_arg_0=0, var_50_arg_1=1, var_78=1] [L168] EXPR var_50_arg_0 | var_50_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_47=1, var_4=0, var_78=1] [L168] SORT_1 var_50 = var_50_arg_0 | var_50_arg_1; [L169] SORT_1 var_51_arg_0 = var_47; [L170] SORT_1 var_51_arg_1 = var_50; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51_arg_0=1, var_51_arg_1=1, var_78=1] [L171] EXPR var_51_arg_0 & var_51_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L171] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L172] SORT_3 var_52_arg_0 = state_25; [L173] SORT_3 var_52_arg_1 = var_4; [L174] SORT_1 var_52 = var_52_arg_0 != var_52_arg_1; [L175] SORT_3 var_53_arg_0 = state_43; [L176] SORT_3 var_53_arg_1 = var_4; [L177] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L178] SORT_1 var_54_arg_0 = var_52; [L179] SORT_1 var_54_arg_1 = var_53; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51=1, var_54_arg_0=0, var_54_arg_1=1, var_78=1] [L180] EXPR var_54_arg_0 | var_54_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_51=1, var_78=1] [L180] SORT_1 var_54 = var_54_arg_0 | var_54_arg_1; [L181] SORT_1 var_55_arg_0 = var_51; [L182] SORT_1 var_55_arg_1 = var_54; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55_arg_0=1, var_55_arg_1=1, var_78=1] [L183] EXPR var_55_arg_0 & var_55_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L183] SORT_1 var_55 = var_55_arg_0 & var_55_arg_1; [L184] SORT_3 var_56_arg_0 = state_25; [L185] SORT_3 var_56_arg_1 = var_4; [L186] SORT_1 var_56 = var_56_arg_0 != var_56_arg_1; [L187] SORT_3 var_57_arg_0 = state_43; [L188] SORT_3 var_57_arg_1 = var_4; [L189] SORT_1 var_57 = var_57_arg_0 == var_57_arg_1; [L190] SORT_1 var_58_arg_0 = var_56; [L191] SORT_1 var_58_arg_1 = var_57; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55=1, var_58_arg_0=0, var_58_arg_1=1, var_78=1] [L192] EXPR var_58_arg_0 | var_58_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_55=1, var_78=1] [L192] SORT_1 var_58 = var_58_arg_0 | var_58_arg_1; [L193] SORT_1 var_59_arg_0 = var_55; [L194] SORT_1 var_59_arg_1 = var_58; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59_arg_0=1, var_59_arg_1=1, var_78=1] [L195] EXPR var_59_arg_0 & var_59_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L195] SORT_1 var_59 = var_59_arg_0 & var_59_arg_1; [L196] SORT_3 var_60_arg_0 = state_43; [L197] SORT_3 var_60_arg_1 = var_4; [L198] SORT_1 var_60 = var_60_arg_0 != var_60_arg_1; [L199] SORT_3 var_61_arg_0 = state_5; [L200] SORT_3 var_61_arg_1 = var_4; [L201] SORT_1 var_61 = var_61_arg_0 == var_61_arg_1; [L202] SORT_1 var_62_arg_0 = var_60; [L203] SORT_1 var_62_arg_1 = var_61; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59=1, var_62_arg_0=0, var_62_arg_1=1, var_78=1] [L204] EXPR var_62_arg_0 | var_62_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_59=1, var_78=1] [L204] SORT_1 var_62 = var_62_arg_0 | var_62_arg_1; [L205] SORT_1 var_63_arg_0 = var_59; [L206] SORT_1 var_63_arg_1 = var_62; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63_arg_0=1, var_63_arg_1=1, var_78=1] [L207] EXPR var_63_arg_0 & var_63_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L207] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L208] SORT_3 var_64_arg_0 = state_43; [L209] SORT_3 var_64_arg_1 = var_4; [L210] SORT_1 var_64 = var_64_arg_0 != var_64_arg_1; [L211] SORT_3 var_65_arg_0 = state_5; [L212] SORT_3 var_65_arg_1 = var_4; [L213] SORT_1 var_65 = var_65_arg_0 == var_65_arg_1; [L214] SORT_1 var_66_arg_0 = var_64; [L215] SORT_1 var_66_arg_1 = var_65; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63=1, var_66_arg_0=0, var_66_arg_1=1, var_78=1] [L216] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_63=1, var_78=1] [L216] SORT_1 var_66 = var_66_arg_0 | var_66_arg_1; [L217] SORT_1 var_67_arg_0 = var_63; [L218] SORT_1 var_67_arg_1 = var_66; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67_arg_0=1, var_67_arg_1=1, var_78=1] [L219] EXPR var_67_arg_0 & var_67_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L219] SORT_1 var_67 = var_67_arg_0 & var_67_arg_1; [L220] SORT_3 var_68_arg_0 = state_43; [L221] SORT_3 var_68_arg_1 = var_4; [L222] SORT_1 var_68 = var_68_arg_0 != var_68_arg_1; [L223] SORT_3 var_69_arg_0 = state_5; [L224] SORT_3 var_69_arg_1 = var_4; [L225] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L226] SORT_1 var_70_arg_0 = var_68; [L227] SORT_1 var_70_arg_1 = var_69; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67=1, var_70_arg_0=0, var_70_arg_1=1, var_78=1] [L228] EXPR var_70_arg_0 | var_70_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_67=1, var_78=1] [L228] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L229] SORT_1 var_71_arg_0 = var_67; [L230] SORT_1 var_71_arg_1 = var_70; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_71_arg_0=1, var_71_arg_1=1, var_78=1] [L231] EXPR var_71_arg_0 & var_71_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_5=0, state_8=0, var_4=0, var_78=1] [L231] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L232] SORT_3 var_72_arg_0 = state_43; [L233] SORT_3 var_72_arg_1 = var_4; [L234] SORT_1 var_72 = var_72_arg_0 != var_72_arg_1; [L235] SORT_3 var_73_arg_0 = state_5; [L236] SORT_3 var_73_arg_1 = var_4; [L237] SORT_1 var_73 = var_73_arg_0 == var_73_arg_1; [L238] SORT_1 var_74_arg_0 = var_72; [L239] SORT_1 var_74_arg_1 = var_73; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_71=1, var_74_arg_0=0, var_74_arg_1=1, var_78=1] [L240] EXPR var_74_arg_0 | var_74_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_71=1, var_78=1] [L240] SORT_1 var_74 = var_74_arg_0 | var_74_arg_1; [L241] SORT_1 var_75_arg_0 = var_71; [L242] SORT_1 var_75_arg_1 = var_74; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_75_arg_0=1, var_75_arg_1=1, var_78=1] [L243] EXPR var_75_arg_0 & var_75_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L243] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L244] SORT_1 var_79_arg_0 = var_75; [L245] SORT_1 var_79 = ~var_79_arg_0; [L246] SORT_1 var_80_arg_0 = var_78; [L247] SORT_1 var_80_arg_1 = var_79; VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1, var_80_arg_0=1, var_80_arg_1=-2] [L248] EXPR var_80_arg_0 & var_80_arg_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L248] SORT_1 var_80 = var_80_arg_0 & var_80_arg_1; [L249] EXPR var_80 & mask_SORT_1 VAL [mask_SORT_1=1, state_25=0, state_43=0, state_8=0, var_4=0, var_78=1] [L249] var_80 = var_80 & mask_SORT_1 [L250] SORT_1 bad_81_arg_0 = var_80; [L251] CALL __VERIFIER_assert(!(bad_81_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 158 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.9s, OverallIterations: 58, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10203 SdHoareTripleChecker+Valid, 13.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10203 mSDsluCounter, 98145 SdHoareTripleChecker+Invalid, 11.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86879 mSDsCounter, 195 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28501 IncrementalHoareTripleChecker+Invalid, 28696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 195 mSolverCounterUnsat, 11266 mSDtfsCounter, 28501 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 766 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 617 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=57, InterpolantAutomatonStates: 669, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 57 MinimizatonAttempts, 1841 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 6.9s SatisfiabilityAnalysisTime, 34.8s InterpolantComputationTime, 5193 NumberOfCodeBlocks, 5193 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 5039 ConstructedInterpolants, 0 QuantifiedInterpolants, 17535 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 57 InterpolantComputations, 57 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 02:57:36,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:57:38,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:57:38,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 02:57:38,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:57:38,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:57:38,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:57:38,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:57:38,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:57:38,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:57:38,737 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:57:38,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:57:38,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:57:38,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:57:38,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:57:38,738 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:57:38,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:57:38,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:57:38,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:57:38,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:57:38,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:57:38,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:57:38,738 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 02:57:38,739 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 02:57:38,739 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:57:38,739 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 02:57:38,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:57:38,739 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:57:38,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:57:38,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:57:38,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:57:38,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:57:38,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:57:38,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:57:38,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:57:38,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:57:38,745 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 02:57:38,745 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 02:57:38,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:57:38,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:57:38,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:57:38,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:57:38,745 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae5f6e98a9adcbdf5e1e7125ae4ea5d0cf3bfadfc22b5bc300cef6d9a8d4cfbb [2024-11-07 02:57:39,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:57:39,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:57:39,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:57:39,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:57:39,219 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:57:39,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2024-11-07 02:57:40,674 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:57:40,993 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:57:40,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c [2024-11-07 02:57:41,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85ce4adcd/3c6f9811b79840fc93d4a2a5b62b4cfa/FLAG6b2436cfd [2024-11-07 02:57:41,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85ce4adcd/3c6f9811b79840fc93d4a2a5b62b4cfa [2024-11-07 02:57:41,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:57:41,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:57:41,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:57:41,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:57:41,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:57:41,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63da895e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41, skipping insertion in model container [2024-11-07 02:57:41,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:57:41,133 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/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2024-11-07 02:57:41,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:57:41,186 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:57:41,193 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/hardware-verification-bv/btor2c-lazyMod.h_Barrel.c[1248,1261] [2024-11-07 02:57:41,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:57:41,235 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:57:41,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41 WrapperNode [2024-11-07 02:57:41,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:57:41,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:57:41,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:57:41,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:57:41,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,280 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 254 [2024-11-07 02:57:41,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:57:41,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:57:41,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:57:41,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:57:41,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,306 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-07 02:57:41,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:57:41,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:57:41,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:57:41,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:57:41,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41" (1/1) ... [2024-11-07 02:57:41,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:57:41,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:57:41,354 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-07 02:57:41,364 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-07 02:57:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:57:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 02:57:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:57:41,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:57:41,493 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:57:41,495 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:57:41,764 INFO L? ?]: Removed 208 outVars from TransFormulas that were not future-live. [2024-11-07 02:57:41,764 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:57:41,789 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:57:41,793 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:57:41,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:57:41 BoogieIcfgContainer [2024-11-07 02:57:41,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:57:41,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:57:41,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:57:41,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:57:41,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:57:41" (1/3) ... [2024-11-07 02:57:41,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13538c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:57:41, skipping insertion in model container [2024-11-07 02:57:41,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:57:41" (2/3) ... [2024-11-07 02:57:41,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13538c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:57:41, skipping insertion in model container [2024-11-07 02:57:41,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:57:41" (3/3) ... [2024-11-07 02:57:41,838 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Barrel.c [2024-11-07 02:57:41,863 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:57:41,864 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:57:41,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:57:41,953 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;@45a8b086, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:57:41,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:57:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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-07 02:57:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 02:57:41,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:41,962 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 02:57:41,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:41,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:41,967 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 02:57:41,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:57:41,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853541050] [2024-11-07 02:57:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:41,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:57:41,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:57:41,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:57:41,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 02:57:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:42,272 WARN L253 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 143 conjuncts are in the unsatisfiable core [2024-11-07 02:57:42,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:57:43,563 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-07 02:57:43,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 02:57:43,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:57:43,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853541050] [2024-11-07 02:57:43,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853541050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:57:43,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:57:43,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:57:43,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210906759] [2024-11-07 02:57:43,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:57:43,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:57:43,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:57:43,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:57:43,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:43,600 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-07 02:57:43,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:57:43,682 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-07 02:57:43,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:57:43,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-07 02:57:43,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:57:43,697 INFO L225 Difference]: With dead ends: 17 [2024-11-07 02:57:43,697 INFO L226 Difference]: Without dead ends: 9 [2024-11-07 02:57:43,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:57:43,705 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:57:43,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:57:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-07 02:57:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-07 02:57:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 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-07 02:57:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 02:57:43,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 02:57:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:57:43,753 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 02:57:43,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-07 02:57:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 02:57:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 02:57:43,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:57:43,754 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 02:57:43,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 02:57:43,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:57:43,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:57:43,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:57:43,957 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 02:57:43,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:57:43,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432040871] [2024-11-07 02:57:43,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:57:43,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:57:43,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:57:43,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:57:43,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 02:57:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:57:44,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 145 conjuncts are in the unsatisfiable core [2024-11-07 02:57:44,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:57:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:57:44,975 INFO L311 TraceCheckSpWp]: Computing backward predicates...