./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal67.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.cal67.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', '868b02930ed023513792020d3580dcb032090dd344327221a3513114156c4d64'] 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.cal67.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 868b02930ed023513792020d3580dcb032090dd344327221a3513114156c4d64 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:33:36,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:33:36,198 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:33:36,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:33:36,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:33:36,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:33:36,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:33:36,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:33:36,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:33:36,231 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:33:36,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:33:36,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:33:36,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:33:36,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:33:36,233 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:33:36,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:33:36,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:33:36,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 02:33:36,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:33:36,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:33:36,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:33:36,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:33:36,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:33:36,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:33:36,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:33:36,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:33:36,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:33:36,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:33:36,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:33:36,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:33:36,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:33:36,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:33:36,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:33:36,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 02:33:36,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 02:33:36,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:33:36,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:33:36,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:33:36,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:33:36,235 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 -> 868b02930ed023513792020d3580dcb032090dd344327221a3513114156c4d64 [2024-11-07 02:33:36,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:33:36,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:33:36,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:33:36,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:33:36,460 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:33:36,461 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.cal67.c [2024-11-07 02:33:37,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:33:38,081 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:33:38,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal67.c [2024-11-07 02:33:38,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/655485c0e/fe1c3148eec448a4940634ea2e917b18/FLAGd24be901e [2024-11-07 02:33:38,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/655485c0e/fe1c3148eec448a4940634ea2e917b18 [2024-11-07 02:33:38,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:33:38,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:33:38,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:33:38,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:33:38,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:33:38,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:33:38" (1/1) ... [2024-11-07 02:33:38,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af3f384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:33:38, skipping insertion in model container [2024-11-07 02:33:38,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:33:38" (1/1) ... [2024-11-07 02:33:38,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:33:38,493 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.cal67.c[1245,1258] [2024-11-07 02:33:39,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:33:39,408 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:33:39,416 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.cal67.c[1245,1258] [2024-11-07 02:33:39,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:33:39,974 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:33:39,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:33:39 WrapperNode [2024-11-07 02:33:39,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:33:39,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:33:39,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:33:39,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:33:39,981 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:33:39" (1/1) ... [2024-11-07 02:33:40,197 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:33:39" (1/1) ... [2024-11-07 02:33:42,391 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 37025 [2024-11-07 02:33:42,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:33:42,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:33:42,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:33:42,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:33:42,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:33:39" (1/1) ... [2024-11-07 02:33:42,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:33:39" (1/1) ... [2024-11-07 02:33:43,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:33:39" (1/1) ... [2024-11-07 02:33:43,677 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-07 02:33:43,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:33:39" (1/1) ... [2024-11-07 02:33:43,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:33:39" (1/1) ... [2024-11-07 02:33:44,312 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:33:39" (1/1) ... [2024-11-07 02:33:44,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:33:39" (1/1) ... [2024-11-07 02:33:44,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:33:39" (1/1) ... [2024-11-07 02:33:44,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:33:39" (1/1) ... [2024-11-07 02:33:45,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:33:45,369 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:33:45,369 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:33:45,369 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:33:45,370 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:33:39" (1/1) ... [2024-11-07 02:33:45,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:33:45,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:33:45,393 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:33:45,396 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:33:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:33:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 02:33:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 02:33:45,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:33:45,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:33:47,066 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:33:47,067 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:34:45,427 INFO L? ?]: Removed 20453 outVars from TransFormulas that were not future-live. [2024-11-07 02:34:45,427 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:34:45,549 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:34:45,549 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:34:45,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:34:45 BoogieIcfgContainer [2024-11-07 02:34:45,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:34:45,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:34:45,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:34:45,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:34:45,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:33:38" (1/3) ... [2024-11-07 02:34:45,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a5e48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:34:45, skipping insertion in model container [2024-11-07 02:34:45,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:33:39" (2/3) ... [2024-11-07 02:34:45,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a5e48f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:34:45, skipping insertion in model container [2024-11-07 02:34:45,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:34:45" (3/3) ... [2024-11-07 02:34:45,557 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal67.c [2024-11-07 02:34:45,568 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:34:45,569 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:34:45,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:34:45,767 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;@1e06fa83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:34:45,767 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:34:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 12658 states, 12656 states have (on average 1.5003950695322377) internal successors, (18989), 12657 states have internal predecessors, (18989), 0 states have call successors, (0), 0 states 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:34:45,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-07 02:34:45,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:34:45,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:45,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:34:45,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:34:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash 103976144, now seen corresponding path program 1 times [2024-11-07 02:34:45,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:34:45,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687487671] [2024-11-07 02:34:45,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:34:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:34:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:34:47,367 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:34:47,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:34:47,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687487671] [2024-11-07 02:34:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687487671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:34:47,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:34:47,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:34:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780369023] [2024-11-07 02:34:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:34:47,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:34:47,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:34:47,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:34:47,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:34:47,417 INFO L87 Difference]: Start difference. First operand has 12658 states, 12656 states have (on average 1.5003950695322377) internal successors, (18989), 12657 states have internal predecessors, (18989), 0 states have call successors, (0), 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 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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:34:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:34:47,896 INFO L93 Difference]: Finished difference Result 25157 states and 37743 transitions. [2024-11-07 02:34:47,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:34:47,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2024-11-07 02:34:47,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:34:47,956 INFO L225 Difference]: With dead ends: 25157 [2024-11-07 02:34:47,956 INFO L226 Difference]: Without dead ends: 12657 [2024-11-07 02:34:47,979 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:34:47,982 INFO L432 NwaCegarLoop]: 18983 mSDtfsCounter, 0 mSDsluCounter, 37960 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56943 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:34:47,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56943 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:34:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12657 states. [2024-11-07 02:34:48,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12657 to 12657. [2024-11-07 02:34:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12657 states, 12656 states have (on average 1.5002370417193427) internal successors, (18987), 12656 states have internal predecessors, (18987), 0 states have call successors, (0), 0 states 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:34:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12657 states to 12657 states and 18987 transitions. [2024-11-07 02:34:48,470 INFO L78 Accepts]: Start accepts. Automaton has 12657 states and 18987 transitions. Word has length 273 [2024-11-07 02:34:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:34:48,473 INFO L471 AbstractCegarLoop]: Abstraction has 12657 states and 18987 transitions. [2024-11-07 02:34:48,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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:34:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 12657 states and 18987 transitions. [2024-11-07 02:34:48,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-11-07 02:34:48,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:34:48,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:48,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 02:34:48,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:34:48,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:34:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1070009937, now seen corresponding path program 1 times [2024-11-07 02:34:48,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:34:48,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108884009] [2024-11-07 02:34:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:34:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:34:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:34:49,083 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:34:49,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:34:49,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108884009] [2024-11-07 02:34:49,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108884009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:34:49,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:34:49,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:34:49,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450671312] [2024-11-07 02:34:49,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:34:49,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:34:49,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:34:49,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:34:49,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:34:49,090 INFO L87 Difference]: Start difference. First operand 12657 states and 18987 transitions. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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:34:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:34:49,369 INFO L93 Difference]: Finished difference Result 25158 states and 37741 transitions. [2024-11-07 02:34:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:34:49,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2024-11-07 02:34:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:34:49,416 INFO L225 Difference]: With dead ends: 25158 [2024-11-07 02:34:49,419 INFO L226 Difference]: Without dead ends: 12659 [2024-11-07 02:34:49,433 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:34:49,434 INFO L432 NwaCegarLoop]: 18983 mSDtfsCounter, 0 mSDsluCounter, 37956 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56939 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:34:49,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56939 Invalid, 15 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:34:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12659 states. [2024-11-07 02:34:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12659 to 12659. [2024-11-07 02:34:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12659 states, 12658 states have (on average 1.500158002844051) internal successors, (18989), 12658 states have internal predecessors, (18989), 0 states have call successors, (0), 0 states 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:34:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12659 states to 12659 states and 18989 transitions. [2024-11-07 02:34:49,665 INFO L78 Accepts]: Start accepts. Automaton has 12659 states and 18989 transitions. Word has length 274 [2024-11-07 02:34:49,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:34:49,666 INFO L471 AbstractCegarLoop]: Abstraction has 12659 states and 18989 transitions. [2024-11-07 02:34:49,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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:34:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 12659 states and 18989 transitions. [2024-11-07 02:34:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-07 02:34:49,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:34:49,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:49,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 02:34:49,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:34:49,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:34:49,673 INFO L85 PathProgramCache]: Analyzing trace with hash 91466121, now seen corresponding path program 1 times [2024-11-07 02:34:49,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:34:49,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394537892] [2024-11-07 02:34:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:34:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:34:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:34:51,331 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:34:51,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:34:51,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394537892] [2024-11-07 02:34:51,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394537892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:34:51,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:34:51,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 02:34:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312425007] [2024-11-07 02:34:51,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:34:51,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:34:51,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:34:51,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:34:51,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:34:51,334 INFO L87 Difference]: Start difference. First operand 12659 states and 18989 transitions. Second operand has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:34:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:34:52,084 INFO L93 Difference]: Finished difference Result 25549 states and 38321 transitions. [2024-11-07 02:34:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:34:52,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2024-11-07 02:34:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:34:52,106 INFO L225 Difference]: With dead ends: 25549 [2024-11-07 02:34:52,106 INFO L226 Difference]: Without dead ends: 13048 [2024-11-07 02:34:52,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:34:52,122 INFO L432 NwaCegarLoop]: 18918 mSDtfsCounter, 20327 mSDsluCounter, 56756 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20327 SdHoareTripleChecker+Valid, 75674 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 02:34:52,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20327 Valid, 75674 Invalid, 266 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 02:34:52,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13048 states. [2024-11-07 02:34:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13048 to 13029. [2024-11-07 02:34:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13029 states, 13028 states have (on average 1.500076757752533) internal successors, (19543), 13028 states have internal predecessors, (19543), 0 states have call successors, (0), 0 states 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:34:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13029 states to 13029 states and 19543 transitions. [2024-11-07 02:34:52,350 INFO L78 Accepts]: Start accepts. Automaton has 13029 states and 19543 transitions. Word has length 275 [2024-11-07 02:34:52,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:34:52,351 INFO L471 AbstractCegarLoop]: Abstraction has 13029 states and 19543 transitions. [2024-11-07 02:34:52,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 6 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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:34:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 13029 states and 19543 transitions. [2024-11-07 02:34:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-11-07 02:34:52,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:34:52,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:52,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 02:34:52,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:34:52,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:34:52,355 INFO L85 PathProgramCache]: Analyzing trace with hash -550629002, now seen corresponding path program 1 times [2024-11-07 02:34:52,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:34:52,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595010321] [2024-11-07 02:34:52,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:34:52,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:34:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:34:53,362 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:34:53,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:34:53,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595010321] [2024-11-07 02:34:53,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595010321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:34:53,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:34:53,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:34:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112722035] [2024-11-07 02:34:53,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:34:53,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:34:53,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:34:53,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:34:53,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:34:53,364 INFO L87 Difference]: Start difference. First operand 13029 states and 19543 transitions. Second operand has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:34:54,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:34:54,280 INFO L93 Difference]: Finished difference Result 25551 states and 38323 transitions. [2024-11-07 02:34:54,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:34:54,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 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 276 [2024-11-07 02:34:54,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:34:54,299 INFO L225 Difference]: With dead ends: 25551 [2024-11-07 02:34:54,299 INFO L226 Difference]: Without dead ends: 13050 [2024-11-07 02:34:54,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-07 02:34:54,313 INFO L432 NwaCegarLoop]: 18917 mSDtfsCounter, 20330 mSDsluCounter, 94581 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20330 SdHoareTripleChecker+Valid, 113498 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 02:34:54,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20330 Valid, 113498 Invalid, 412 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 02:34:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13050 states. [2024-11-07 02:34:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13050 to 13032. [2024-11-07 02:34:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13032 states, 13031 states have (on average 1.5000383700406723) internal successors, (19547), 13031 states have internal predecessors, (19547), 0 states have call successors, (0), 0 states 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:34:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13032 states to 13032 states and 19547 transitions. [2024-11-07 02:34:54,518 INFO L78 Accepts]: Start accepts. Automaton has 13032 states and 19547 transitions. Word has length 276 [2024-11-07 02:34:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:34:54,518 INFO L471 AbstractCegarLoop]: Abstraction has 13032 states and 19547 transitions. [2024-11-07 02:34:54,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:34:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 13032 states and 19547 transitions. [2024-11-07 02:34:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-07 02:34:54,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:34:54,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:54,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 02:34:54,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:34:54,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:34:54,521 INFO L85 PathProgramCache]: Analyzing trace with hash 429718150, now seen corresponding path program 1 times [2024-11-07 02:34:54,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:34:54,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420294869] [2024-11-07 02:34:54,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:34:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:34:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:34:56,290 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:34:56,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:34:56,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420294869] [2024-11-07 02:34:56,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420294869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:34:56,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:34:56,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 02:34:56,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662746073] [2024-11-07 02:34:56,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:34:56,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 02:34:56,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:34:56,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 02:34:56,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 02:34:56,294 INFO L87 Difference]: Start difference. First operand 13032 states and 19547 transitions. Second operand has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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:34:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:34:57,334 INFO L93 Difference]: Finished difference Result 25551 states and 38322 transitions. [2024-11-07 02:34:57,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:34:57,334 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 0 states have call successors, (0), 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 277 [2024-11-07 02:34:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:34:57,353 INFO L225 Difference]: With dead ends: 25551 [2024-11-07 02:34:57,353 INFO L226 Difference]: Without dead ends: 13050 [2024-11-07 02:34:57,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2024-11-07 02:34:57,368 INFO L432 NwaCegarLoop]: 18903 mSDtfsCounter, 20326 mSDsluCounter, 113418 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20326 SdHoareTripleChecker+Valid, 132321 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 02:34:57,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20326 Valid, 132321 Invalid, 575 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 02:34:57,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13050 states. [2024-11-07 02:34:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13050 to 13036. [2024-11-07 02:34:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13036 states, 13035 states have (on average 1.4999616417337935) internal successors, (19552), 13035 states have internal predecessors, (19552), 0 states have call successors, (0), 0 states 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:34:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13036 states to 13036 states and 19552 transitions. [2024-11-07 02:34:57,564 INFO L78 Accepts]: Start accepts. Automaton has 13036 states and 19552 transitions. Word has length 277 [2024-11-07 02:34:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:34:57,564 INFO L471 AbstractCegarLoop]: Abstraction has 13036 states and 19552 transitions. [2024-11-07 02:34:57,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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:34:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 13036 states and 19552 transitions. [2024-11-07 02:34:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-07 02:34:57,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:34:57,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:57,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 02:34:57,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:34:57,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:34:57,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2000907605, now seen corresponding path program 1 times [2024-11-07 02:34:57,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:34:57,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467273988] [2024-11-07 02:34:57,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:34:57,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:34:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:34:59,065 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:34:59,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:34:59,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467273988] [2024-11-07 02:34:59,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467273988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:34:59,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:34:59,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:34:59,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349362304] [2024-11-07 02:34:59,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:34:59,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:34:59,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:34:59,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:34:59,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:34:59,067 INFO L87 Difference]: Start difference. First operand 13036 states and 19552 transitions. Second operand has 8 states, 8 states have (on average 34.75) internal successors, (278), 8 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)