./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.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.cal1.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', '41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a'] 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.cal1.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 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:13:13,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:13:13,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 02:13:13,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:13:13,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:13:13,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:13:13,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:13:13,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:13:13,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:13:13,180 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:13:13,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:13:13,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:13:13,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:13:13,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:13:13,181 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:13:13,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:13:13,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:13:13,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 02:13:13,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:13:13,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:13:13,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:13:13,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:13:13,182 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:13:13,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:13:13,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:13:13,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:13:13,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:13:13,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:13:13,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:13:13,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:13:13,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:13:13,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:13:13,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:13:13,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 02:13:13,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 02:13:13,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:13:13,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:13:13,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:13:13,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:13:13,184 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 -> 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a [2024-11-07 02:13:13,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:13:13,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:13:13,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:13:13,415 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:13:13,415 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:13:13,417 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.cal1.c [2024-11-07 02:13:14,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:13:14,824 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:13:14,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c [2024-11-07 02:13:14,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3ff99960/36809a11e1384ac79bceedecbf8a2c41/FLAG0cf168053 [2024-11-07 02:13:14,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3ff99960/36809a11e1384ac79bceedecbf8a2c41 [2024-11-07 02:13:14,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:13:14,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:13:14,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:13:14,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:13:14,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:13:14,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:13:14" (1/1) ... [2024-11-07 02:13:14,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1f093a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:14, skipping insertion in model container [2024-11-07 02:13:14,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:13:14" (1/1) ... [2024-11-07 02:13:14,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:13:15,012 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.cal1.c[1244,1257] [2024-11-07 02:13:15,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:13:15,167 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:13:15,173 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.cal1.c[1244,1257] [2024-11-07 02:13:15,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:13:15,267 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:13:15,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15 WrapperNode [2024-11-07 02:13:15,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:13:15,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:13:15,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:13:15,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:13:15,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15" (1/1) ... [2024-11-07 02:13:15,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15" (1/1) ... [2024-11-07 02:13:15,408 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1798 [2024-11-07 02:13:15,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:13:15,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:13:15,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:13:15,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:13:15,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15" (1/1) ... [2024-11-07 02:13:15,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15" (1/1) ... [2024-11-07 02:13:15,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15" (1/1) ... [2024-11-07 02:13:15,468 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-07 02:13:15,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15" (1/1) ... [2024-11-07 02:13:15,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15" (1/1) ... [2024-11-07 02:13:15,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15" (1/1) ... [2024-11-07 02:13:15,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15" (1/1) ... [2024-11-07 02:13:15,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15" (1/1) ... [2024-11-07 02:13:15,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15" (1/1) ... [2024-11-07 02:13:15,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:13:15,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:13:15,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:13:15,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:13:15,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15" (1/1) ... [2024-11-07 02:13:15,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:13:15,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:13:15,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 02:13:15,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 02:13:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:13:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 02:13:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 02:13:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:13:15,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:13:15,858 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:13:15,859 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:13:17,109 INFO L? ?]: Removed 1027 outVars from TransFormulas that were not future-live. [2024-11-07 02:13:17,110 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:13:17,120 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:13:17,120 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:13:17,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:13:17 BoogieIcfgContainer [2024-11-07 02:13:17,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:13:17,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:13:17,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:13:17,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:13:17,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:13:14" (1/3) ... [2024-11-07 02:13:17,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a32284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:13:17, skipping insertion in model container [2024-11-07 02:13:17,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:15" (2/3) ... [2024-11-07 02:13:17,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a32284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:13:17, skipping insertion in model container [2024-11-07 02:13:17,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:13:17" (3/3) ... [2024-11-07 02:13:17,129 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal1.c [2024-11-07 02:13:17,139 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:13:17,140 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:13:17,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:13:17,197 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;@1e1778a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:13:17,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:13:17,202 INFO L276 IsEmpty]: Start isEmpty. Operand has 330 states, 328 states have (on average 1.4969512195121952) internal successors, (491), 329 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 02:13:17,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:13:17,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:13:17,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:13:17,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:13:17,214 INFO L85 PathProgramCache]: Analyzing trace with hash -949079131, now seen corresponding path program 1 times [2024-11-07 02:13:17,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:13:17,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456410137] [2024-11-07 02:13:17,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:13:17,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:13:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:13:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:13:17,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:13:17,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456410137] [2024-11-07 02:13:17,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456410137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:13:17,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:13:17,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:13:17,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011966954] [2024-11-07 02:13:17,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:13:17,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:13:17,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:13:17,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:13:17,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:13:17,920 INFO L87 Difference]: Start difference. First operand has 330 states, 328 states have (on average 1.4969512195121952) internal successors, (491), 329 states have internal predecessors, (491), 0 states have call successors, (0), 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 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:17,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:13:17,989 INFO L93 Difference]: Finished difference Result 537 states and 801 transitions. [2024-11-07 02:13:17,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:13:17,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 02:13:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:13:18,000 INFO L225 Difference]: With dead ends: 537 [2024-11-07 02:13:18,000 INFO L226 Difference]: Without dead ends: 329 [2024-11-07 02:13:18,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:13:18,007 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:13:18,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1449 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:13:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-07 02:13:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2024-11-07 02:13:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.4908536585365855) internal successors, (489), 328 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 489 transitions. [2024-11-07 02:13:18,043 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 489 transitions. Word has length 79 [2024-11-07 02:13:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:13:18,043 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 489 transitions. [2024-11-07 02:13:18,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 489 transitions. [2024-11-07 02:13:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 02:13:18,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:13:18,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:13:18,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 02:13:18,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:13:18,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:13:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash 645013645, now seen corresponding path program 1 times [2024-11-07 02:13:18,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:13:18,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397245808] [2024-11-07 02:13:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:13:18,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:13:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:13:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:13:18,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:13:18,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397245808] [2024-11-07 02:13:18,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397245808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:13:18,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:13:18,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:13:18,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689716056] [2024-11-07 02:13:18,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:13:18,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:13:18,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:13:18,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:13:18,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:13:18,250 INFO L87 Difference]: Start difference. First operand 329 states and 489 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:13:18,292 INFO L93 Difference]: Finished difference Result 538 states and 799 transitions. [2024-11-07 02:13:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:13:18,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-07 02:13:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:13:18,294 INFO L225 Difference]: With dead ends: 538 [2024-11-07 02:13:18,296 INFO L226 Difference]: Without dead ends: 331 [2024-11-07 02:13:18,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:13:18,297 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:13:18,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1445 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:13:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-07 02:13:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2024-11-07 02:13:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.4878787878787878) internal successors, (491), 330 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 491 transitions. [2024-11-07 02:13:18,312 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 491 transitions. Word has length 80 [2024-11-07 02:13:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:13:18,312 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 491 transitions. [2024-11-07 02:13:18,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 491 transitions. [2024-11-07 02:13:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 02:13:18,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:13:18,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:13:18,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 02:13:18,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:13:18,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:13:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1717588350, now seen corresponding path program 1 times [2024-11-07 02:13:18,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:13:18,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204666989] [2024-11-07 02:13:18,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:13:18,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:13:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:13:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:13:18,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:13:18,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204666989] [2024-11-07 02:13:18,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204666989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:13:18,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:13:18,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 02:13:18,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069062916] [2024-11-07 02:13:18,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:13:18,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:13:18,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:13:18,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:13:18,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:13:18,735 INFO L87 Difference]: Start difference. First operand 331 states and 491 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:13:18,878 INFO L93 Difference]: Finished difference Result 577 states and 851 transitions. [2024-11-07 02:13:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:13:18,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-07 02:13:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:13:18,880 INFO L225 Difference]: With dead ends: 577 [2024-11-07 02:13:18,881 INFO L226 Difference]: Without dead ends: 368 [2024-11-07 02:13:18,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:13:18,884 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 523 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:13:18,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1890 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:13:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-07 02:13:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 349. [2024-11-07 02:13:18,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.485632183908046) internal successors, (517), 348 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 517 transitions. [2024-11-07 02:13:18,897 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 517 transitions. Word has length 81 [2024-11-07 02:13:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:13:18,897 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 517 transitions. [2024-11-07 02:13:18,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 517 transitions. [2024-11-07 02:13:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 02:13:18,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:13:18,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:13:18,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 02:13:18,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:13:18,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:13:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1680448716, now seen corresponding path program 1 times [2024-11-07 02:13:18,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:13:18,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277039743] [2024-11-07 02:13:18,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:13:18,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:13:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:13:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:13:19,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:13:19,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277039743] [2024-11-07 02:13:19,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277039743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:13:19,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:13:19,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:13:19,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942153742] [2024-11-07 02:13:19,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:13:19,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:13:19,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:13:19,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:13:19,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:13:19,235 INFO L87 Difference]: Start difference. First operand 349 states and 517 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:13:19,392 INFO L93 Difference]: Finished difference Result 579 states and 853 transitions. [2024-11-07 02:13:19,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:13:19,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-07 02:13:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:13:19,394 INFO L225 Difference]: With dead ends: 579 [2024-11-07 02:13:19,394 INFO L226 Difference]: Without dead ends: 370 [2024-11-07 02:13:19,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-07 02:13:19,395 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 526 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 2822 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:13:19,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 2822 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:13:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-07 02:13:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 352. [2024-11-07 02:13:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 1.4843304843304843) internal successors, (521), 351 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 521 transitions. [2024-11-07 02:13:19,400 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 521 transitions. Word has length 82 [2024-11-07 02:13:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:13:19,401 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 521 transitions. [2024-11-07 02:13:19,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 521 transitions. [2024-11-07 02:13:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 02:13:19,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:13:19,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:13:19,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 02:13:19,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:13:19,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:13:19,402 INFO L85 PathProgramCache]: Analyzing trace with hash -234955877, now seen corresponding path program 1 times [2024-11-07 02:13:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:13:19,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744534086] [2024-11-07 02:13:19,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:13:19,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:13:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:13:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:13:19,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:13:19,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744534086] [2024-11-07 02:13:19,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744534086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:13:19,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:13:19,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:13:19,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621490741] [2024-11-07 02:13:19,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:13:19,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:13:19,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:13:19,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:13:19,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:13:19,914 INFO L87 Difference]: Start difference. First operand 352 states and 521 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:13:20,125 INFO L93 Difference]: Finished difference Result 579 states and 852 transitions. [2024-11-07 02:13:20,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:13:20,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-07 02:13:20,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:13:20,128 INFO L225 Difference]: With dead ends: 579 [2024-11-07 02:13:20,128 INFO L226 Difference]: Without dead ends: 370 [2024-11-07 02:13:20,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-07 02:13:20,129 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 521 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2804 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:13:20,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2804 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:13:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-07 02:13:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 356. [2024-11-07 02:13:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 1.4816901408450704) internal successors, (526), 355 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 526 transitions. [2024-11-07 02:13:20,141 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 526 transitions. Word has length 83 [2024-11-07 02:13:20,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:13:20,141 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 526 transitions. [2024-11-07 02:13:20,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 526 transitions. [2024-11-07 02:13:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-07 02:13:20,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:13:20,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:13:20,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 02:13:20,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:13:20,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:13:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1424119309, now seen corresponding path program 1 times [2024-11-07 02:13:20,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:13:20,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256393401] [2024-11-07 02:13:20,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:13:20,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:13:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:13:20,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 02:13:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:13:20,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 02:13:20,249 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 02:13:20,250 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 02:13:20,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 02:13:20,253 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 02:13:20,299 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 02:13:20,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:13:20 BoogieIcfgContainer [2024-11-07 02:13:20,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 02:13:20,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 02:13:20,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 02:13:20,306 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 02:13:20,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:13:17" (3/4) ... [2024-11-07 02:13:20,308 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 02:13:20,308 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 02:13:20,310 INFO L158 Benchmark]: Toolchain (without parser) took 5454.50ms. Allocated memory was 100.7MB in the beginning and 260.0MB in the end (delta: 159.4MB). Free memory was 75.4MB in the beginning and 129.7MB in the end (delta: -54.3MB). Peak memory consumption was 109.7MB. Max. memory is 16.1GB. [2024-11-07 02:13:20,311 INFO L158 Benchmark]: CDTParser took 1.38ms. Allocated memory is still 83.9MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:13:20,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.55ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 69.9MB in the end (delta: 5.4MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-11-07 02:13:20,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 139.27ms. Allocated memory is still 100.7MB. Free memory was 69.9MB in the beginning and 42.0MB in the end (delta: 27.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 02:13:20,312 INFO L158 Benchmark]: Boogie Preprocessor took 185.30ms. Allocated memory was 100.7MB in the beginning and 109.1MB in the end (delta: 8.4MB). Free memory was 42.0MB in the beginning and 62.5MB in the end (delta: -20.6MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-07 02:13:20,312 INFO L158 Benchmark]: RCFGBuilder took 1526.19ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 62.5MB in the beginning and 63.5MB in the end (delta: -988.0kB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. [2024-11-07 02:13:20,312 INFO L158 Benchmark]: TraceAbstraction took 3182.20ms. Allocated memory was 192.9MB in the beginning and 260.0MB in the end (delta: 67.1MB). Free memory was 63.1MB in the beginning and 129.7MB in the end (delta: -66.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:13:20,312 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 260.0MB. Free memory was 129.7MB in the beginning and 129.7MB in the end (delta: 27.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 02:13:20,313 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38ms. Allocated memory is still 83.9MB. Free memory is still 48.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.55ms. Allocated memory is still 100.7MB. Free memory was 75.3MB in the beginning and 69.9MB in the end (delta: 5.4MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 139.27ms. Allocated memory is still 100.7MB. Free memory was 69.9MB in the beginning and 42.0MB in the end (delta: 27.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 185.30ms. Allocated memory was 100.7MB in the beginning and 109.1MB in the end (delta: 8.4MB). Free memory was 42.0MB in the beginning and 62.5MB in the end (delta: -20.6MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1526.19ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 62.5MB in the beginning and 63.5MB in the end (delta: -988.0kB). Peak memory consumption was 91.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3182.20ms. Allocated memory was 192.9MB in the beginning and 260.0MB in the end (delta: 67.1MB). Free memory was 63.1MB in the beginning and 129.7MB in the end (delta: -66.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 260.0MB. Free memory was 129.7MB in the beginning and 129.7MB in the end (delta: 27.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 bitwiseOr at line 261, overapproximation of bitwiseAnd at line 266. 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_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L30] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 4); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (4 - 1); [L35] const SORT_14 mask_SORT_14 = (SORT_14)-1 >> (sizeof(SORT_14) * 8 - 64); [L36] const SORT_14 msb_SORT_14 = (SORT_14)1 << (64 - 1); [L38] const SORT_1 var_56 = 0; [L39] const SORT_6 var_60 = 0; [L40] const SORT_1 var_73 = 1; [L41] const SORT_14 var_77 = 0; [L42] const SORT_10 var_98 = 0; [L44] SORT_1 input_2; [L45] SORT_1 input_3; [L46] SORT_1 input_4; [L47] SORT_1 input_5; [L48] SORT_6 input_7; [L49] SORT_6 input_8; [L50] SORT_1 input_9; [L51] SORT_10 input_11; [L52] SORT_1 input_12; [L53] SORT_1 input_13; [L54] SORT_14 input_15; [L55] SORT_10 input_16; [L56] SORT_1 input_17; [L57] SORT_6 input_18; [L58] SORT_1 input_19; [L59] SORT_10 input_20; [L60] SORT_10 input_21; [L61] SORT_6 input_22; [L62] SORT_6 input_23; [L63] SORT_1 input_24; [L64] SORT_14 input_25; [L65] SORT_10 input_26; [L66] SORT_1 input_27; [L67] SORT_6 input_28; [L68] SORT_6 input_29; [L69] SORT_6 input_30; [L70] SORT_6 input_31; [L71] SORT_10 input_32; [L72] SORT_10 input_33; [L73] SORT_10 input_34; [L74] SORT_10 input_35; [L75] SORT_10 input_36; [L76] SORT_10 input_37; [L77] SORT_10 input_38; [L78] SORT_10 input_39; [L79] SORT_1 input_40; [L80] SORT_1 input_41; [L81] SORT_1 input_42; [L82] SORT_1 input_43; [L83] SORT_1 input_44; [L84] SORT_1 input_45; [L85] SORT_14 input_46; [L86] SORT_14 input_47; [L87] SORT_14 input_48; [L88] SORT_14 input_49; [L89] SORT_6 input_50; [L90] SORT_6 input_51; [L91] SORT_1 input_52; [L92] SORT_1 input_53; [L93] SORT_1 input_54; [L94] SORT_1 input_55; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L96] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L97] SORT_6 state_61 = __VERIFIER_nondet_uint() & mask_SORT_6; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L98] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L99] SORT_6 state_66 = __VERIFIER_nondet_uint() & mask_SORT_6; [L100] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L100] SORT_14 state_78 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L101] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L101] SORT_14 state_81 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L102] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L102] SORT_1 state_84 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L103] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L103] SORT_1 state_90 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L104] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L104] SORT_1 state_93 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L105] SORT_10 state_99 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L106] SORT_10 state_102 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L107] SORT_1 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L108] SORT_1 state_123 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L109] SORT_10 state_135 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L110] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L110] SORT_10 state_138 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L111] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L111] SORT_6 state_148 = __VERIFIER_nondet_uint() & mask_SORT_6; [L112] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L112] SORT_6 state_156 = __VERIFIER_nondet_uint() & mask_SORT_6; [L113] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_14=-1, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L113] SORT_14 state_170 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L114] EXPR __VERIFIER_nondet_ulong() & mask_SORT_14 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L114] SORT_14 state_173 = __VERIFIER_nondet_ulong() & mask_SORT_14; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L115] SORT_1 state_176 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L116] SORT_10 state_179 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L117] SORT_1 state_184 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L118] SORT_1 state_191 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L119] SORT_10 state_196 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L120] SORT_1 state_212 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L121] SORT_10 state_217 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L122] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=15, mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L122] SORT_1 state_223 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L123] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L123] SORT_10 state_238 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L124] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L124] SORT_6 state_249 = __VERIFIER_nondet_uint() & mask_SORT_6; [L125] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_6=-1, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L125] SORT_6 state_282 = __VERIFIER_nondet_uint() & mask_SORT_6; [L127] SORT_1 init_58_arg_1 = var_56; [L128] state_57 = init_58_arg_1 [L129] SORT_6 init_62_arg_1 = var_60; [L130] state_61 = init_62_arg_1 [L131] SORT_1 init_64_arg_1 = var_56; [L132] state_63 = init_64_arg_1 [L133] SORT_6 init_67_arg_1 = var_60; [L134] state_66 = init_67_arg_1 [L135] SORT_14 init_79_arg_1 = var_77; [L136] state_78 = init_79_arg_1 [L137] SORT_14 init_82_arg_1 = var_77; [L138] state_81 = init_82_arg_1 [L139] SORT_1 init_85_arg_1 = var_56; [L140] state_84 = init_85_arg_1 [L141] SORT_1 init_91_arg_1 = var_56; [L142] state_90 = init_91_arg_1 [L143] SORT_1 init_94_arg_1 = var_56; [L144] state_93 = init_94_arg_1 [L145] SORT_10 init_100_arg_1 = var_98; [L146] state_99 = init_100_arg_1 [L147] SORT_10 init_103_arg_1 = var_98; [L148] state_102 = init_103_arg_1 [L149] SORT_1 init_117_arg_1 = var_56; [L150] state_116 = init_117_arg_1 [L151] SORT_1 init_124_arg_1 = var_56; [L152] state_123 = init_124_arg_1 [L153] SORT_10 init_136_arg_1 = var_98; [L154] state_135 = init_136_arg_1 [L155] SORT_10 init_139_arg_1 = var_98; [L156] state_138 = init_139_arg_1 [L157] SORT_6 init_149_arg_1 = var_60; [L158] state_148 = init_149_arg_1 [L159] SORT_6 init_157_arg_1 = var_60; [L160] state_156 = init_157_arg_1 [L161] SORT_14 init_171_arg_1 = var_77; [L162] state_170 = init_171_arg_1 [L163] SORT_14 init_174_arg_1 = var_77; [L164] state_173 = init_174_arg_1 [L165] SORT_1 init_177_arg_1 = var_56; [L166] state_176 = init_177_arg_1 [L167] SORT_10 init_180_arg_1 = var_98; [L168] state_179 = init_180_arg_1 [L169] SORT_1 init_185_arg_1 = var_56; [L170] state_184 = init_185_arg_1 [L171] SORT_1 init_192_arg_1 = var_56; [L172] state_191 = init_192_arg_1 [L173] SORT_10 init_197_arg_1 = var_98; [L174] state_196 = init_197_arg_1 [L175] SORT_1 init_213_arg_1 = var_56; [L176] state_212 = init_213_arg_1 [L177] SORT_10 init_218_arg_1 = var_98; [L178] state_217 = init_218_arg_1 [L179] SORT_1 init_224_arg_1 = var_56; [L180] state_223 = init_224_arg_1 [L181] SORT_10 init_239_arg_1 = var_98; [L182] state_238 = init_239_arg_1 [L183] SORT_6 init_250_arg_1 = var_60; [L184] state_249 = init_250_arg_1 [L185] SORT_6 init_283_arg_1 = var_60; [L186] state_282 = init_283_arg_1 VAL [mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L189] input_2 = __VERIFIER_nondet_uchar() [L190] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L190] input_2 = input_2 & mask_SORT_1 [L191] input_3 = __VERIFIER_nondet_uchar() [L192] input_4 = __VERIFIER_nondet_uchar() [L193] input_5 = __VERIFIER_nondet_uchar() [L194] input_7 = __VERIFIER_nondet_uint() [L195] input_8 = __VERIFIER_nondet_uint() [L196] input_9 = __VERIFIER_nondet_uchar() [L197] EXPR input_9 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_61=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_73=1, var_77=0, var_98=0] [L197] input_9 = input_9 & mask_SORT_1 [L198] input_11 = __VERIFIER_nondet_uchar() [L199] input_12 = __VERIFIER_nondet_uchar() [L200] input_13 = __VERIFIER_nondet_uchar() [L201] input_15 = __VERIFIER_nondet_ulong() [L202] input_16 = __VERIFIER_nondet_uchar() [L203] input_17 = __VERIFIER_nondet_uchar() [L204] input_18 = __VERIFIER_nondet_uint() [L205] input_19 = __VERIFIER_nondet_uchar() [L206] input_20 = __VERIFIER_nondet_uchar() [L207] input_21 = __VERIFIER_nondet_uchar() [L208] input_22 = __VERIFIER_nondet_uint() [L209] input_23 = __VERIFIER_nondet_uint() [L210] input_24 = __VERIFIER_nondet_uchar() [L211] input_25 = __VERIFIER_nondet_ulong() [L212] input_26 = __VERIFIER_nondet_uchar() [L213] input_27 = __VERIFIER_nondet_uchar() [L214] input_28 = __VERIFIER_nondet_uint() [L215] input_29 = __VERIFIER_nondet_uint() [L216] input_30 = __VERIFIER_nondet_uint() [L217] input_31 = __VERIFIER_nondet_uint() [L218] input_32 = __VERIFIER_nondet_uchar() [L219] input_33 = __VERIFIER_nondet_uchar() [L220] input_34 = __VERIFIER_nondet_uchar() [L221] input_35 = __VERIFIER_nondet_uchar() [L222] input_36 = __VERIFIER_nondet_uchar() [L223] input_37 = __VERIFIER_nondet_uchar() [L224] input_38 = __VERIFIER_nondet_uchar() [L225] input_39 = __VERIFIER_nondet_uchar() [L226] input_40 = __VERIFIER_nondet_uchar() [L227] input_41 = __VERIFIER_nondet_uchar() [L228] input_42 = __VERIFIER_nondet_uchar() [L229] input_43 = __VERIFIER_nondet_uchar() [L230] input_44 = __VERIFIER_nondet_uchar() [L231] input_45 = __VERIFIER_nondet_uchar() [L232] input_46 = __VERIFIER_nondet_ulong() [L233] input_47 = __VERIFIER_nondet_ulong() [L234] input_48 = __VERIFIER_nondet_ulong() [L235] input_49 = __VERIFIER_nondet_ulong() [L236] input_50 = __VERIFIER_nondet_uint() [L237] input_51 = __VERIFIER_nondet_uint() [L238] input_52 = __VERIFIER_nondet_uchar() [L239] input_53 = __VERIFIER_nondet_uchar() [L240] input_54 = __VERIFIER_nondet_uchar() [L241] input_55 = __VERIFIER_nondet_uchar() [L244] SORT_1 var_59_arg_0 = state_57; [L245] SORT_1 var_59 = ~var_59_arg_0; [L246] SORT_1 var_65_arg_0 = state_63; [L247] SORT_6 var_65_arg_1 = state_61; [L248] SORT_6 var_65_arg_2 = input_18; [L249] SORT_6 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; VAL [input_18=0, input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L250] EXPR var_65 & mask_SORT_6 VAL [input_18=0, input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_66=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_73=1, var_77=0, var_98=0] [L250] var_65 = var_65 & mask_SORT_6 [L251] SORT_1 var_68_arg_0 = state_63; [L252] SORT_6 var_68_arg_1 = state_66; [L253] SORT_6 var_68_arg_2 = input_18; [L254] SORT_6 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_65=0, var_68=0, var_73=1, var_77=0, var_98=0] [L255] EXPR var_68 & mask_SORT_6 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_59=-1, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L255] var_68 = var_68 & mask_SORT_6 [L256] SORT_6 var_69_arg_0 = var_65; [L257] SORT_6 var_69_arg_1 = var_68; [L258] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L259] SORT_1 var_70_arg_0 = var_59; [L260] SORT_1 var_70_arg_1 = var_69; VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_70_arg_0=-1, var_70_arg_1=1, var_73=1, var_77=0, var_98=0] [L261] EXPR var_70_arg_0 | var_70_arg_1 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L261] SORT_1 var_70 = var_70_arg_0 | var_70_arg_1; [L262] SORT_1 var_74_arg_0 = var_70; [L263] SORT_1 var_74 = ~var_74_arg_0; [L264] SORT_1 var_75_arg_0 = var_73; [L265] SORT_1 var_75_arg_1 = var_74; VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_75_arg_0=1, var_75_arg_1=-1, var_77=0, var_98=0] [L266] EXPR var_75_arg_0 & var_75_arg_1 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L266] SORT_1 var_75 = var_75_arg_0 & var_75_arg_1; [L267] EXPR var_75 & mask_SORT_1 VAL [input_2=0, input_9=0, mask_SORT_1=1, mask_SORT_6=-1, state_102=0, state_116=0, state_123=0, state_135=0, state_138=0, state_148=0, state_156=0, state_170=0, state_173=0, state_176=0, state_179=0, state_184=0, state_191=0, state_196=0, state_212=0, state_217=0, state_223=0, state_238=0, state_249=0, state_282=0, state_57=0, state_63=0, state_78=0, state_81=0, state_84=0, state_90=0, state_93=0, state_99=0, var_56=0, var_60=0, var_65=0, var_73=1, var_77=0, var_98=0] [L267] var_75 = var_75 & mask_SORT_1 [L268] SORT_1 bad_76_arg_0 = var_75; [L269] CALL __VERIFIER_assert(!(bad_76_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 330 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1570 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1570 mSDsluCounter, 10410 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8030 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 2380 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=5, InterpolantAutomatonStates: 31, 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, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 489 NumberOfCodeBlocks, 489 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 400 ConstructedInterpolants, 0 QuantifiedInterpolants, 1261 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 02:13:20,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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.cal1.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 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:13:22,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:13:22,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 02:13:22,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:13:22,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:13:22,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:13:22,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:13:22,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:13:22,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:13:22,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:13:22,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:13:22,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:13:22,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:13:22,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:13:22,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:13:22,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:13:22,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:13:22,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:13:22,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:13:22,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:13:22,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:13:22,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:13:22,157 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 02:13:22,157 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 02:13:22,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:13:22,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:13:22,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:13:22,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:13:22,157 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 -> 41f47466632cef79c6428d332b083f6bab28594818001ff9f9c3e4bbd8dd136a [2024-11-07 02:13:22,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:13:22,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:13:22,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:13:22,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:13:22,431 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:13:22,431 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.cal1.c [2024-11-07 02:13:23,590 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:13:23,804 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:13:23,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal1.c [2024-11-07 02:13:23,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39441111a/4bfcd7326e614800a514a513a37859e3/FLAG02eed325a [2024-11-07 02:13:24,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/39441111a/4bfcd7326e614800a514a513a37859e3 [2024-11-07 02:13:24,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:13:24,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:13:24,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:13:24,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:13:24,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:13:24,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7231fe6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24, skipping insertion in model container [2024-11-07 02:13:24,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:13:24,280 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.cal1.c[1244,1257] [2024-11-07 02:13:24,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:13:24,429 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:13:24,437 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.cal1.c[1244,1257] [2024-11-07 02:13:24,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:13:24,509 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:13:24,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24 WrapperNode [2024-11-07 02:13:24,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:13:24,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:13:24,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:13:24,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:13:24,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,584 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1158 [2024-11-07 02:13:24,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:13:24,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:13:24,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:13:24,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:13:24,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,616 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-07 02:13:24,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,629 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,640 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:13:24,641 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:13:24,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:13:24,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:13:24,642 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24" (1/1) ... [2024-11-07 02:13:24,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:13:24,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:13:24,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 02:13:24,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 02:13:24,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:13:24,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 02:13:24,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 02:13:24,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:13:24,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:13:24,875 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:13:24,876 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:13:25,497 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-11-07 02:13:25,497 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:13:25,509 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:13:25,509 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:13:25,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:13:25 BoogieIcfgContainer [2024-11-07 02:13:25,510 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:13:25,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:13:25,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:13:25,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:13:25,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:13:24" (1/3) ... [2024-11-07 02:13:25,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d7805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:13:25, skipping insertion in model container [2024-11-07 02:13:25,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:13:24" (2/3) ... [2024-11-07 02:13:25,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d7805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:13:25, skipping insertion in model container [2024-11-07 02:13:25,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:13:25" (3/3) ... [2024-11-07 02:13:25,518 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal1.c [2024-11-07 02:13:25,527 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:13:25,527 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:13:25,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:13:25,571 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;@65f73841, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:13:25,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:13:25,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:25,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 02:13:25,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:13:25,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 02:13:25,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:13:25,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:13:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 02:13:25,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:13:25,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753587671] [2024-11-07 02:13:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:13:25,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:13:25,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:13:25,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:13:25,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 02:13:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:13:25,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 02:13:25,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:13:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:13:25,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 02:13:25,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:13:25,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753587671] [2024-11-07 02:13:25,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753587671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:13:25,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:13:25,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:13:25,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032599339] [2024-11-07 02:13:25,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:13:25,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:13:25,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:13:25,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:13:25,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:13:25,971 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:13:26,119 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-07 02:13:26,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:13:26,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 02:13:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:13:26,125 INFO L225 Difference]: With dead ends: 18 [2024-11-07 02:13:26,125 INFO L226 Difference]: Without dead ends: 10 [2024-11-07 02:13:26,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:13:26,128 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:13:26,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:13:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-07 02:13:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-07 02:13:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:26,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 02:13:26,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 02:13:26,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:13:26,147 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 02:13:26,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:13:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 02:13:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 02:13:26,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:13:26,148 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 02:13:26,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 02:13:26,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:13:26,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:13:26,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:13:26,352 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 02:13:26,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:13:26,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323053664] [2024-11-07 02:13:26,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:13:26,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:13:26,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:13:26,355 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:13:26,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 02:13:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:13:26,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 02:13:26,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:13:26,834 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 02:13:26,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 02:13:27,353 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 02:13:27,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:13:27,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323053664] [2024-11-07 02:13:27,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323053664] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 02:13:27,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 02:13:27,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 02:13:27,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153209545] [2024-11-07 02:13:27,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 02:13:27,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:13:27,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:13:27,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:13:27,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:13:27,356 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 02:13:27,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:13:27,629 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-07 02:13:27,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:13:27,629 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 02:13:27,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:13:27,630 INFO L225 Difference]: With dead ends: 15 [2024-11-07 02:13:27,630 INFO L226 Difference]: Without dead ends: 13 [2024-11-07 02:13:27,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-07 02:13:27,631 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:13:27,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 17 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:13:27,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-07 02:13:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-07 02:13:27,633 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 02:13:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-07 02:13:27,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-07 02:13:27,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:13:27,634 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-07 02:13:27,634 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 02:13:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-07 02:13:27,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 02:13:27,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:13:27,634 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-07 02:13:27,644 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 (3)] Forceful destruction successful, exit code 0 [2024-11-07 02:13:27,835 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 02:13:27,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:13:27,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:13:27,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-07 02:13:27,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:13:27,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506982675] [2024-11-07 02:13:27,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 02:13:27,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:13:27,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:13:27,839 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 02:13:27,839 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 02:13:28,367 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 02:13:28,367 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 02:13:28,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 02:13:28,405 INFO L278 TraceCheckSpWp]: Computing forward predicates...