./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.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.vis_arrays_am2910_p2.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', '3aad10085a254dcaf040179ecd6942588b0bc48b7dc5ef8e6965b5c3dd9887c2'] 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.vis_arrays_am2910_p2.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 3aad10085a254dcaf040179ecd6942588b0bc48b7dc5ef8e6965b5c3dd9887c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:49:03,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:49:03,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 03:49:03,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:49:03,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:49:03,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:49:03,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:49:03,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:49:03,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:49:03,530 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:49:03,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:49:03,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:49:03,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:49:03,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:49:03,530 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:49:03,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:49:03,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:49:03,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:49:03,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:49:03,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:49:03,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:49:03,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:49:03,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:49:03,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:49:03,531 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:49:03,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:49:03,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:49:03,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:49:03,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:49:03,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:49:03,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:49:03,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:49:03,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:49:03,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:49:03,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:49:03,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:49:03,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:49:03,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:49:03,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:49:03,532 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 -> 3aad10085a254dcaf040179ecd6942588b0bc48b7dc5ef8e6965b5c3dd9887c2 [2024-11-07 03:49:03,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:49:03,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:49:03,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:49:03,870 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:49:03,871 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:49:03,872 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.vis_arrays_am2910_p2.c [2024-11-07 03:49:05,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:49:05,426 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:49:05,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-11-07 03:49:05,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3c3afb7d/ba622f261a184b299d74d8c258770415/FLAG075d4914e [2024-11-07 03:49:05,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3c3afb7d/ba622f261a184b299d74d8c258770415 [2024-11-07 03:49:05,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:49:05,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:49:05,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:49:05,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:49:05,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:49:05,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:05,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40cc2c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05, skipping insertion in model container [2024-11-07 03:49:05,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:05,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:49:05,622 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.vis_arrays_am2910_p2.c[1260,1273] [2024-11-07 03:49:05,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:49:05,716 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:49:05,725 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.vis_arrays_am2910_p2.c[1260,1273] [2024-11-07 03:49:05,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:49:05,811 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:49:05,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05 WrapperNode [2024-11-07 03:49:05,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:49:05,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:49:05,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:49:05,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:49:05,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:05,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:05,916 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 607 [2024-11-07 03:49:05,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:49:05,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:49:05,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:49:05,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:49:05,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:05,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:05,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:05,992 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 03:49:05,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:05,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:06,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:06,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:06,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:06,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:06,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:49:06,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:49:06,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:49:06,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:49:06,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05" (1/1) ... [2024-11-07 03:49:06,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:49:06,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:49:06,089 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 03:49:06,093 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 03:49:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:49:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:49:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:49:06,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:49:06,262 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:49:06,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:49:07,226 INFO L? ?]: Removed 331 outVars from TransFormulas that were not future-live. [2024-11-07 03:49:07,226 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:49:07,242 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:49:07,244 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:49:07,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:49:07 BoogieIcfgContainer [2024-11-07 03:49:07,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:49:07,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:49:07,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:49:07,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:49:07,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:49:05" (1/3) ... [2024-11-07 03:49:07,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41261636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:49:07, skipping insertion in model container [2024-11-07 03:49:07,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:05" (2/3) ... [2024-11-07 03:49:07,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41261636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:49:07, skipping insertion in model container [2024-11-07 03:49:07,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:49:07" (3/3) ... [2024-11-07 03:49:07,256 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-11-07 03:49:07,270 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:49:07,271 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:49:07,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:49:07,346 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;@118962cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:49:07,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:49:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 149 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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 03:49:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 03:49:07,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:49:07,362 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] [2024-11-07 03:49:07,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:49:07,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:49:07,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1135438275, now seen corresponding path program 1 times [2024-11-07 03:49:07,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:49:07,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844122795] [2024-11-07 03:49:07,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:49:07,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:49:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:49:08,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 03:49:08,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:49:08,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844122795] [2024-11-07 03:49:08,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844122795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:49:08,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:49:08,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:49:08,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957383575] [2024-11-07 03:49:08,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:49:08,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:49:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:49:08,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:49:08,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:49:08,080 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 149 states have internal predecessors, (221), 0 states have call successors, (0), 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 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 03:49:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:49:08,155 INFO L93 Difference]: Finished difference Result 281 states and 417 transitions. [2024-11-07 03:49:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:49:08,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-07 03:49:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:49:08,169 INFO L225 Difference]: With dead ends: 281 [2024-11-07 03:49:08,170 INFO L226 Difference]: Without dead ends: 149 [2024-11-07 03:49:08,173 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 03:49:08,177 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 639 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 03:49:08,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 639 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:49:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-07 03:49:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-07 03:49:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.4797297297297298) internal successors, (219), 148 states have internal predecessors, (219), 0 states have call successors, (0), 0 states 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 03:49:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2024-11-07 03:49:08,224 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 23 [2024-11-07 03:49:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:49:08,224 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2024-11-07 03:49:08,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 03:49:08,225 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2024-11-07 03:49:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 03:49:08,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:49:08,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] [2024-11-07 03:49:08,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:49:08,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:49:08,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:49:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash 840543427, now seen corresponding path program 1 times [2024-11-07 03:49:08,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:49:08,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367259387] [2024-11-07 03:49:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:49:08,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:49:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:49:08,459 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 03:49:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:49:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367259387] [2024-11-07 03:49:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367259387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:49:08,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:49:08,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:49:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666766933] [2024-11-07 03:49:08,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:49:08,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:49:08,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:49:08,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:49:08,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:49:08,464 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 03:49:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:49:08,516 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2024-11-07 03:49:08,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:49:08,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-07 03:49:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:49:08,519 INFO L225 Difference]: With dead ends: 282 [2024-11-07 03:49:08,521 INFO L226 Difference]: Without dead ends: 151 [2024-11-07 03:49:08,522 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 03:49:08,522 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 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 03:49:08,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:49:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-07 03:49:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-07 03:49:08,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.4733333333333334) internal successors, (221), 150 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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 03:49:08,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2024-11-07 03:49:08,532 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 24 [2024-11-07 03:49:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:49:08,533 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2024-11-07 03:49:08,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 03:49:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2024-11-07 03:49:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 03:49:08,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:49:08,533 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] [2024-11-07 03:49:08,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:49:08,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:49:08,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:49:08,535 INFO L85 PathProgramCache]: Analyzing trace with hash -810923364, now seen corresponding path program 1 times [2024-11-07 03:49:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:49:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689121767] [2024-11-07 03:49:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:49:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:49:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:49:08,906 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 03:49:08,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:49:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689121767] [2024-11-07 03:49:08,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689121767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:49:08,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:49:08,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:49:08,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613651415] [2024-11-07 03:49:08,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:49:08,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:49:08,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:49:08,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:49:08,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:49:08,910 INFO L87 Difference]: Start difference. First operand 151 states and 221 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 03:49:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:49:09,015 INFO L93 Difference]: Finished difference Result 288 states and 422 transitions. [2024-11-07 03:49:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:49:09,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-07 03:49:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:49:09,017 INFO L225 Difference]: With dead ends: 288 [2024-11-07 03:49:09,017 INFO L226 Difference]: Without dead ends: 155 [2024-11-07 03:49:09,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:49:09,018 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 208 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:49:09,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 819 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:49:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-07 03:49:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-11-07 03:49:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 153 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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 03:49:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2024-11-07 03:49:09,028 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 25 [2024-11-07 03:49:09,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:49:09,028 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2024-11-07 03:49:09,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 03:49:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2024-11-07 03:49:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 03:49:09,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:49:09,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:49:09,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:49:09,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:49:09,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:49:09,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2099242586, now seen corresponding path program 1 times [2024-11-07 03:49:09,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:49:09,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005731381] [2024-11-07 03:49:09,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:49:09,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:49:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:49:09,596 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 03:49:09,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:49:09,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005731381] [2024-11-07 03:49:09,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005731381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:49:09,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:49:09,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:49:09,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291292416] [2024-11-07 03:49:09,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:49:09,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:49:09,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:49:09,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:49:09,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:49:09,598 INFO L87 Difference]: Start difference. First operand 154 states and 224 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:49:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:49:09,770 INFO L93 Difference]: Finished difference Result 301 states and 439 transitions. [2024-11-07 03:49:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:49:09,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-07 03:49:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:49:09,772 INFO L225 Difference]: With dead ends: 301 [2024-11-07 03:49:09,773 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 03:49:09,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 03:49:09,774 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 229 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:49:09,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1009 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:49:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 03:49:09,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2024-11-07 03:49:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 1.4539877300613497) internal successors, (237), 163 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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 03:49:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2024-11-07 03:49:09,789 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 26 [2024-11-07 03:49:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:49:09,789 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2024-11-07 03:49:09,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:49:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2024-11-07 03:49:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 03:49:09,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:49:09,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:49:09,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:49:09,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:49:09,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:49:09,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1540066410, now seen corresponding path program 1 times [2024-11-07 03:49:09,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:49:09,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145077767] [2024-11-07 03:49:09,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:49:09,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:49:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:49:10,152 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 03:49:10,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:49:10,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145077767] [2024-11-07 03:49:10,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145077767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:49:10,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:49:10,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:49:10,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241088320] [2024-11-07 03:49:10,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:49:10,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:49:10,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:49:10,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:49:10,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:49:10,157 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:49:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:49:10,290 INFO L93 Difference]: Finished difference Result 308 states and 447 transitions. [2024-11-07 03:49:10,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:49:10,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-07 03:49:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:49:10,292 INFO L225 Difference]: With dead ends: 308 [2024-11-07 03:49:10,293 INFO L226 Difference]: Without dead ends: 172 [2024-11-07 03:49:10,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:49:10,297 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 211 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1214 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 03:49:10,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1214 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:49:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-07 03:49:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2024-11-07 03:49:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.4578313253012047) internal successors, (242), 166 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 03:49:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 242 transitions. [2024-11-07 03:49:10,313 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 242 transitions. Word has length 26 [2024-11-07 03:49:10,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:49:10,313 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 242 transitions. [2024-11-07 03:49:10,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:49:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 242 transitions. [2024-11-07 03:49:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 03:49:10,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:49:10,318 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] [2024-11-07 03:49:10,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 03:49:10,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:49:10,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:49:10,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2061963672, now seen corresponding path program 1 times [2024-11-07 03:49:10,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:49:10,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283313071] [2024-11-07 03:49:10,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:49:10,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:49:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:49:10,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:49:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:49:10,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:49:10,433 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:49:10,434 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:49:10,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 03:49:10,439 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 03:49:10,488 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:49:10,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:49:10 BoogieIcfgContainer [2024-11-07 03:49:10,494 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:49:10,495 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:49:10,495 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:49:10,495 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:49:10,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:49:07" (3/4) ... [2024-11-07 03:49:10,498 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:49:10,499 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:49:10,500 INFO L158 Benchmark]: Toolchain (without parser) took 5045.55ms. Allocated memory was 117.4MB in the beginning and 192.9MB in the end (delta: 75.5MB). Free memory was 92.0MB in the beginning and 108.7MB in the end (delta: -16.7MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2024-11-07 03:49:10,500 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:49:10,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.56ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 73.4MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:49:10,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.43ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 60.3MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:49:10,501 INFO L158 Benchmark]: Boogie Preprocessor took 129.81ms. Allocated memory is still 117.4MB. Free memory was 60.3MB in the beginning and 52.4MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:49:10,502 INFO L158 Benchmark]: RCFGBuilder took 1196.93ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 52.4MB in the beginning and 107.0MB in the end (delta: -54.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-11-07 03:49:10,502 INFO L158 Benchmark]: TraceAbstraction took 3246.52ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 106.4MB in the beginning and 108.7MB in the end (delta: -2.4MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-11-07 03:49:10,502 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 192.9MB. Free memory was 108.7MB in the beginning and 108.7MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:49:10,504 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.31ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.56ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 73.4MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.43ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 60.3MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.81ms. Allocated memory is still 117.4MB. Free memory was 60.3MB in the beginning and 52.4MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1196.93ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 52.4MB in the beginning and 107.0MB in the end (delta: -54.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3246.52ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 106.4MB in the beginning and 108.7MB in the end (delta: -2.4MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 192.9MB. Free memory was 108.7MB in the beginning and 108.7MB in the end (delta: 37.5kB). 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 131. 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L32] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 4); [L33] const SORT_7 msb_SORT_7 = (SORT_7)1 << (4 - 1); [L35] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 3); [L36] const SORT_16 msb_SORT_16 = (SORT_16)1 << (3 - 1); [L38] const SORT_1 var_12 = 0; [L39] const SORT_16 var_17 = 0; [L40] const SORT_16 var_20 = 6; [L41] const SORT_16 var_25 = 7; [L42] const SORT_1 var_30 = 1; [L43] const SORT_5 var_34 = 0; [L44] const SORT_7 var_39 = 0; [L45] const SORT_7 var_42 = 8; [L46] const SORT_7 var_44 = 9; [L47] const SORT_7 var_47 = 15; [L48] const SORT_7 var_55 = 12; [L49] const SORT_7 var_58 = 4; [L50] const SORT_7 var_64 = 10; [L51] const SORT_7 var_66 = 11; [L52] const SORT_7 var_69 = 13; [L53] const SORT_7 var_84 = 1; [L54] const SORT_7 var_89 = 5; [L55] const SORT_16 var_114 = 1; [L56] const SORT_16 var_116 = 5; [L57] const SORT_5 var_125 = 1; [L59] SORT_1 input_2; [L60] SORT_1 input_3; [L61] SORT_1 input_4; [L62] SORT_5 input_6; [L63] SORT_7 input_8; [L64] SORT_1 input_9; [L65] SORT_1 input_10; [L66] SORT_1 input_11; [L67] SORT_5 input_93; [L68] SORT_5 input_95; [L69] SORT_5 input_97; [L70] SORT_5 input_99; [L71] SORT_5 input_101; [L72] SORT_5 input_103; [L73] SORT_5 input_105; [L74] SORT_5 input_107; [L75] SORT_5 input_109; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_34=0, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L77] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_16 VAL [mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_34=0, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L78] SORT_16 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_16; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_16 VAL [mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_34=0, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L79] SORT_16 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_16; [L80] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_34=0, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L80] SORT_5 state_35 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L82] SORT_1 init_14_arg_1 = var_12; [L83] state_13 = init_14_arg_1 [L84] SORT_16 init_19_arg_1 = var_17; [L85] state_18 = init_19_arg_1 [L86] SORT_16 init_24_arg_1 = var_17; [L87] state_23 = init_24_arg_1 [L88] SORT_5 init_36_arg_1 = var_34; [L89] state_35 = init_36_arg_1 VAL [mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_13=0, state_18=0, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L92] input_2 = __VERIFIER_nondet_uchar() [L93] input_3 = __VERIFIER_nondet_uchar() [L94] input_4 = __VERIFIER_nondet_uchar() [L95] input_6 = __VERIFIER_nondet_ushort() [L96] input_8 = __VERIFIER_nondet_uchar() [L97] EXPR input_8 & mask_SORT_7 VAL [mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_13=0, state_18=0, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L97] input_8 = input_8 & mask_SORT_7 [L98] input_9 = __VERIFIER_nondet_uchar() [L99] input_10 = __VERIFIER_nondet_uchar() [L100] input_11 = __VERIFIER_nondet_uchar() [L101] input_93 = __VERIFIER_nondet_ushort() [L102] input_95 = __VERIFIER_nondet_ushort() [L103] input_97 = __VERIFIER_nondet_ushort() [L104] input_99 = __VERIFIER_nondet_ushort() [L105] input_101 = __VERIFIER_nondet_ushort() [L106] input_103 = __VERIFIER_nondet_ushort() [L107] input_105 = __VERIFIER_nondet_ushort() [L108] input_107 = __VERIFIER_nondet_ushort() [L109] input_109 = __VERIFIER_nondet_ushort() [L112] SORT_1 var_15_arg_0 = state_13; [L113] SORT_1 var_15_arg_1 = var_12; [L114] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L115] SORT_16 var_21_arg_0 = state_18; [L116] SORT_16 var_21_arg_1 = var_20; [L117] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L118] SORT_1 var_22_arg_0 = var_15; [L119] SORT_1 var_22_arg_1 = var_21; VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_22_arg_0=1, var_22_arg_1=1, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L120] EXPR var_22_arg_0 | var_22_arg_1 VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L120] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L121] SORT_16 var_26_arg_0 = state_23; [L122] SORT_16 var_26_arg_1 = var_25; [L123] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L124] SORT_1 var_27_arg_0 = var_22; [L125] SORT_1 var_27_arg_1 = var_26; VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_27_arg_0=1, var_27_arg_1=0, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L126] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L126] SORT_1 var_27 = var_27_arg_0 | var_27_arg_1; [L127] SORT_1 var_31_arg_0 = var_27; [L128] SORT_1 var_31 = ~var_31_arg_0; [L129] SORT_1 var_32_arg_0 = var_30; [L130] SORT_1 var_32_arg_1 = var_31; VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_32_arg_0=1, var_32_arg_1=-2, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L131] EXPR var_32_arg_0 & var_32_arg_1 VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L131] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L132] EXPR var_32 & mask_SORT_1 VAL [input_8=0, mask_SORT_16=7, mask_SORT_1=1, mask_SORT_5=4095, mask_SORT_7=15, state_23=0, state_35=0, var_114=1, var_116=5, var_125=1, var_12=0, var_17=0, var_20=6, var_25=7, var_30=1, var_39=0, var_42=8, var_44=9, var_47=15, var_55=12, var_58=4, var_64=10, var_66=11, var_69=13, var_84=1, var_89=5] [L132] var_32 = var_32 & mask_SORT_1 [L133] SORT_1 bad_33_arg_0 = var_32; [L134] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 648 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 648 mSDsluCounter, 4316 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3268 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 1048 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=5, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 03:49:10,534 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.vis_arrays_am2910_p2.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 3aad10085a254dcaf040179ecd6942588b0bc48b7dc5ef8e6965b5c3dd9887c2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:49:12,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:49:12,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 03:49:12,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:49:12,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:49:12,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:49:12,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:49:12,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:49:12,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:49:12,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:49:12,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:49:12,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:49:12,987 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:49:12,987 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:49:12,987 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:49:12,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:49:12,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:49:12,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:49:12,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:49:12,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:49:12,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:49:12,987 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:49:12,988 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:49:12,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:49:12,988 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:49:12,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:49:12,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:49:12,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:49:12,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:49:12,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:49:12,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:49:12,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:49:12,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:49:12,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:49:12,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:49:12,989 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:49:12,989 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:49:12,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:49:12,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:49:12,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:49:12,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:49:12,990 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 -> 3aad10085a254dcaf040179ecd6942588b0bc48b7dc5ef8e6965b5c3dd9887c2 [2024-11-07 03:49:13,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:49:13,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:49:13,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:49:13,287 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:49:13,287 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:49:13,288 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.vis_arrays_am2910_p2.c [2024-11-07 03:49:14,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:49:14,878 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:49:14,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-11-07 03:49:14,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2092aeba/94efc0eaee5f45418a2c3109e30308f1/FLAG7c159c397 [2024-11-07 03:49:14,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a2092aeba/94efc0eaee5f45418a2c3109e30308f1 [2024-11-07 03:49:14,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:49:14,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:49:14,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:49:14,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:49:14,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:49:14,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:49:14" (1/1) ... [2024-11-07 03:49:14,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bbe6af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:14, skipping insertion in model container [2024-11-07 03:49:14,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:49:14" (1/1) ... [2024-11-07 03:49:14,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:49:15,111 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.vis_arrays_am2910_p2.c[1260,1273] [2024-11-07 03:49:15,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:49:15,244 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:49:15,253 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.vis_arrays_am2910_p2.c[1260,1273] [2024-11-07 03:49:15,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:49:15,324 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:49:15,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15 WrapperNode [2024-11-07 03:49:15,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:49:15,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:49:15,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:49:15,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:49:15,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15" (1/1) ... [2024-11-07 03:49:15,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15" (1/1) ... [2024-11-07 03:49:15,379 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 327 [2024-11-07 03:49:15,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:49:15,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:49:15,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:49:15,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:49:15,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15" (1/1) ... [2024-11-07 03:49:15,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15" (1/1) ... [2024-11-07 03:49:15,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15" (1/1) ... [2024-11-07 03:49:15,434 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 03:49:15,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15" (1/1) ... [2024-11-07 03:49:15,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15" (1/1) ... [2024-11-07 03:49:15,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15" (1/1) ... [2024-11-07 03:49:15,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15" (1/1) ... [2024-11-07 03:49:15,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15" (1/1) ... [2024-11-07 03:49:15,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15" (1/1) ... [2024-11-07 03:49:15,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:49:15,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:49:15,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:49:15,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:49:15,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15" (1/1) ... [2024-11-07 03:49:15,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:49:15,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:49:15,506 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 03:49:15,512 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 03:49:15,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:49:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:49:15,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:49:15,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:49:15,696 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:49:15,698 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:49:16,059 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-07 03:49:16,059 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:49:16,066 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:49:16,067 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:49:16,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:49:16 BoogieIcfgContainer [2024-11-07 03:49:16,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:49:16,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:49:16,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:49:16,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:49:16,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:49:14" (1/3) ... [2024-11-07 03:49:16,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dac6222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:49:16, skipping insertion in model container [2024-11-07 03:49:16,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:15" (2/3) ... [2024-11-07 03:49:16,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dac6222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:49:16, skipping insertion in model container [2024-11-07 03:49:16,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:49:16" (3/3) ... [2024-11-07 03:49:16,078 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2910_p2.c [2024-11-07 03:49:16,091 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:49:16,092 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:49:16,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:49:16,153 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;@72fe5e20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:49:16,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:49:16,161 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 03:49:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 03:49:16,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:49:16,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 03:49:16,168 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:49:16,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:49:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 03:49:16,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:49:16,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303354834] [2024-11-07 03:49:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:49:16,186 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 03:49:16,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:49:16,190 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 03:49:16,192 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 03:49:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:49:16,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 03:49:16,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:49:16,571 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 03:49:16,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:49:16,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:49:16,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303354834] [2024-11-07 03:49:16,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303354834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:49:16,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:49:16,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:49:16,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562844251] [2024-11-07 03:49:16,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:49:16,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:49:16,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:49:16,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:49:16,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:49:16,604 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 03:49:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:49:16,648 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-07 03:49:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:49:16,652 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 03:49:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:49:16,658 INFO L225 Difference]: With dead ends: 17 [2024-11-07 03:49:16,659 INFO L226 Difference]: Without dead ends: 9 [2024-11-07 03:49:16,661 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 03:49:16,665 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:49:16,666 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.0s Time] [2024-11-07 03:49:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-07 03:49:16,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-07 03:49:16,690 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 03:49:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 03:49:16,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 03:49:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:49:16,698 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 03:49:16,699 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 03:49:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 03:49:16,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 03:49:16,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:49:16,699 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 03:49:16,705 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-07 03:49:16,900 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 03:49:16,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:49:16,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:49:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 03:49:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:49:16,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000645568] [2024-11-07 03:49:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:49:16,902 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 03:49:16,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:49:16,906 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 03:49:16,907 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 03:49:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:49:17,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 03:49:17,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:49:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:49:17,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:49:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:49:17,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:49:17,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000645568] [2024-11-07 03:49:17,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000645568] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:49:17,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:49:17,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 03:49:17,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337244569] [2024-11-07 03:49:17,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:49:17,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 03:49:17,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:49:17,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 03:49:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:49:17,522 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 03:49:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:49:17,624 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-07 03:49:17,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:49:17,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 8 [2024-11-07 03:49:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:49:17,625 INFO L225 Difference]: With dead ends: 14 [2024-11-07 03:49:17,626 INFO L226 Difference]: Without dead ends: 12 [2024-11-07 03:49:17,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:49:17,627 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:49:17,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:49:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-07 03:49:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-07 03:49:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states 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 03:49:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-07 03:49:17,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-07 03:49:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:49:17,631 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-07 03:49:17,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 03:49:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-07 03:49:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 03:49:17,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:49:17,633 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-07 03:49:17,637 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 (3)] Ended with exit code 0 [2024-11-07 03:49:17,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 03:49:17,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:49:17,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:49:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-07 03:49:17,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:49:17,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282051881] [2024-11-07 03:49:17,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 03:49:17,835 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 03:49:17,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:49:17,838 INFO L229 MonitoredProcess]: Starting monitored process 4 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 03:49:17,840 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 (4)] Waiting until timeout for monitored process [2024-11-07 03:49:18,022 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 03:49:18,022 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 03:49:18,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 03:49:18,036 INFO L278 TraceCheckSpWp]: Computing forward predicates...