./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.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.krebs.1.prop1-func-interl.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', '2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158'] 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.krebs.1.prop1-func-interl.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 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:00:51,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:00:51,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 03:00:51,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:00:51,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:00:51,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:00:51,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:00:51,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:00:51,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:00:51,545 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:00:51,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:00:51,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:00:51,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:00:51,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:00:51,547 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:00:51,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:00:51,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:00:51,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:00:51,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:00:51,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:00:51,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:00:51,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:00:51,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:00:51,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:00:51,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:00:51,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:00:51,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:00:51,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:00:51,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:00:51,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:00:51,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:00:51,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:00:51,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:00:51,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:00:51,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:00:51,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:00:51,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:00:51,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:00:51,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:00:51,552 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 -> 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 [2024-11-07 03:00:51,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:00:51,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:00:51,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:00:51,873 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:00:51,874 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:00:51,876 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.krebs.1.prop1-func-interl.c [2024-11-07 03:00:53,194 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:00:53,553 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:00:53,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-11-07 03:00:53,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f08d44e2e/efc0e9c7bd8542b9960b358487f7cca7/FLAGb88a75546 [2024-11-07 03:00:53,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f08d44e2e/efc0e9c7bd8542b9960b358487f7cca7 [2024-11-07 03:00:53,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:00:53,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:00:53,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:00:53,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:00:53,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:00:53,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:00:53" (1/1) ... [2024-11-07 03:00:53,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff9f92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:53, skipping insertion in model container [2024-11-07 03:00:53,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:00:53" (1/1) ... [2024-11-07 03:00:53,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:00:53,835 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.krebs.1.prop1-func-interl.c[1172,1185] [2024-11-07 03:00:54,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:00:54,076 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:00:54,085 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.krebs.1.prop1-func-interl.c[1172,1185] [2024-11-07 03:00:54,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:00:54,254 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:00:54,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54 WrapperNode [2024-11-07 03:00:54,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:00:54,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:00:54,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:00:54,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:00:54,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54" (1/1) ... [2024-11-07 03:00:54,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54" (1/1) ... [2024-11-07 03:00:54,797 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3252 [2024-11-07 03:00:54,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:00:54,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:00:54,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:00:54,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:00:54,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54" (1/1) ... [2024-11-07 03:00:54,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54" (1/1) ... [2024-11-07 03:00:54,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54" (1/1) ... [2024-11-07 03:00:55,097 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 03:00:55,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54" (1/1) ... [2024-11-07 03:00:55,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54" (1/1) ... [2024-11-07 03:00:55,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54" (1/1) ... [2024-11-07 03:00:55,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54" (1/1) ... [2024-11-07 03:00:55,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54" (1/1) ... [2024-11-07 03:00:55,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54" (1/1) ... [2024-11-07 03:00:55,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:00:55,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:00:55,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:00:55,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:00:55,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54" (1/1) ... [2024-11-07 03:00:55,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:00:55,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:00:55,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 03:00:55,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 03:00:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:00:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:00:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:00:55,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:00:55,733 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:00:55,735 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:00:59,067 INFO L? ?]: Removed 1863 outVars from TransFormulas that were not future-live. [2024-11-07 03:00:59,067 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:00:59,111 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:00:59,112 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:00:59,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:00:59 BoogieIcfgContainer [2024-11-07 03:00:59,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:00:59,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:00:59,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:00:59,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:00:59,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:00:53" (1/3) ... [2024-11-07 03:00:59,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e82bd4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:00:59, skipping insertion in model container [2024-11-07 03:00:59,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:00:54" (2/3) ... [2024-11-07 03:00:59,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e82bd4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:00:59, skipping insertion in model container [2024-11-07 03:00:59,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:00:59" (3/3) ... [2024-11-07 03:00:59,123 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-11-07 03:00:59,137 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:00:59,137 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:00:59,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:00:59,240 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;@3c83830f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:00:59,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:00:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 1078 states, 1076 states have (on average 1.5065055762081785) internal successors, (1621), 1077 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:00:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-07 03:00:59,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:00:59,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:00:59,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:00:59,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:00:59,268 INFO L85 PathProgramCache]: Analyzing trace with hash 155026089, now seen corresponding path program 1 times [2024-11-07 03:00:59,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:00:59,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668955712] [2024-11-07 03:00:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:00:59,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:00:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:01:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:01:00,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:01:00,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668955712] [2024-11-07 03:01:00,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668955712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:01:00,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:01:00,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:01:00,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959705906] [2024-11-07 03:01:00,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:01:00,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:01:00,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:01:00,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:01:00,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:01:00,214 INFO L87 Difference]: Start difference. First operand has 1078 states, 1076 states have (on average 1.5065055762081785) internal successors, (1621), 1077 states have internal predecessors, (1621), 0 states have call successors, (0), 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 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:01:00,386 INFO L93 Difference]: Finished difference Result 2049 states and 3085 transitions. [2024-11-07 03:01:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:01:00,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-07 03:01:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:01:00,411 INFO L225 Difference]: With dead ends: 2049 [2024-11-07 03:01:00,412 INFO L226 Difference]: Without dead ends: 1077 [2024-11-07 03:01:00,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:01:00,420 INFO L432 NwaCegarLoop]: 1615 mSDtfsCounter, 0 mSDsluCounter, 3224 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:01:00,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4839 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:01:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-11-07 03:01:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1077. [2024-11-07 03:01:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.504646840148699) internal successors, (1619), 1076 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1619 transitions. [2024-11-07 03:01:00,516 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1619 transitions. Word has length 87 [2024-11-07 03:01:00,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:01:00,516 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1619 transitions. [2024-11-07 03:01:00,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1619 transitions. [2024-11-07 03:01:00,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 03:01:00,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:01:00,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:01:00,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:01:00,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:01:00,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:01:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash 512537149, now seen corresponding path program 1 times [2024-11-07 03:01:00,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:01:00,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994059448] [2024-11-07 03:01:00,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:01:00,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:01:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:01:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:01:00,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:01:00,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994059448] [2024-11-07 03:01:00,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994059448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:01:00,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:01:00,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:01:00,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887781137] [2024-11-07 03:01:00,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:01:00,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:01:00,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:01:00,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:01:00,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:01:00,874 INFO L87 Difference]: Start difference. First operand 1077 states and 1619 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:01:00,953 INFO L93 Difference]: Finished difference Result 2050 states and 3083 transitions. [2024-11-07 03:01:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:01:00,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-11-07 03:01:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:01:00,961 INFO L225 Difference]: With dead ends: 2050 [2024-11-07 03:01:00,961 INFO L226 Difference]: Without dead ends: 1079 [2024-11-07 03:01:00,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:01:00,965 INFO L432 NwaCegarLoop]: 1615 mSDtfsCounter, 0 mSDsluCounter, 3220 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4835 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:01:00,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4835 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:01:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2024-11-07 03:01:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2024-11-07 03:01:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.5037105751391466) internal successors, (1621), 1078 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1621 transitions. [2024-11-07 03:01:00,996 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1621 transitions. Word has length 88 [2024-11-07 03:01:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:01:00,997 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1621 transitions. [2024-11-07 03:01:00,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1621 transitions. [2024-11-07 03:01:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 03:01:01,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:01:01,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:01:01,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:01:01,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:01:01,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:01:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1905784322, now seen corresponding path program 1 times [2024-11-07 03:01:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:01:01,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538378369] [2024-11-07 03:01:01,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:01:01,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:01:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:01:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:01:01,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:01:01,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538378369] [2024-11-07 03:01:01,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538378369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:01:01,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:01:01,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:01:01,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725645336] [2024-11-07 03:01:01,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:01:01,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:01:01,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:01:01,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:01:01,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:01:01,360 INFO L87 Difference]: Start difference. First operand 1079 states and 1621 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:01:01,416 INFO L93 Difference]: Finished difference Result 2054 states and 3087 transitions. [2024-11-07 03:01:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:01:01,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2024-11-07 03:01:01,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:01:01,422 INFO L225 Difference]: With dead ends: 2054 [2024-11-07 03:01:01,422 INFO L226 Difference]: Without dead ends: 1081 [2024-11-07 03:01:01,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:01:01,425 INFO L432 NwaCegarLoop]: 1615 mSDtfsCounter, 0 mSDsluCounter, 3214 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4829 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:01:01,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4829 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:01:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2024-11-07 03:01:01,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2024-11-07 03:01:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1080 states have (on average 1.5027777777777778) internal successors, (1623), 1080 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1623 transitions. [2024-11-07 03:01:01,456 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1623 transitions. Word has length 89 [2024-11-07 03:01:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:01:01,456 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1623 transitions. [2024-11-07 03:01:01,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1623 transitions. [2024-11-07 03:01:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-07 03:01:01,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:01:01,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:01:01,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:01:01,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:01:01,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:01:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash -141340828, now seen corresponding path program 1 times [2024-11-07 03:01:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:01:01,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491964915] [2024-11-07 03:01:01,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:01:01,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:01:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:01:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:01:01,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:01:01,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491964915] [2024-11-07 03:01:01,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491964915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:01:01,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:01:01,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:01:01,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066682216] [2024-11-07 03:01:01,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:01:01,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:01:01,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:01:01,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:01:01,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:01:01,704 INFO L87 Difference]: Start difference. First operand 1081 states and 1623 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:01,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:01:01,767 INFO L93 Difference]: Finished difference Result 2064 states and 3099 transitions. [2024-11-07 03:01:01,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:01:01,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-11-07 03:01:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:01:01,772 INFO L225 Difference]: With dead ends: 2064 [2024-11-07 03:01:01,773 INFO L226 Difference]: Without dead ends: 1089 [2024-11-07 03:01:01,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:01:01,775 INFO L432 NwaCegarLoop]: 1615 mSDtfsCounter, 3 mSDsluCounter, 3214 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4829 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:01:01,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4829 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:01:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2024-11-07 03:01:01,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1085. [2024-11-07 03:01:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1084 states have (on average 1.5027675276752768) internal successors, (1629), 1084 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1629 transitions. [2024-11-07 03:01:01,801 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1629 transitions. Word has length 90 [2024-11-07 03:01:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:01:01,801 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1629 transitions. [2024-11-07 03:01:01,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1629 transitions. [2024-11-07 03:01:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 03:01:01,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:01:01,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:01:01,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:01:01,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:01:01,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:01:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1027595355, now seen corresponding path program 1 times [2024-11-07 03:01:01,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:01:01,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045229580] [2024-11-07 03:01:01,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:01:01,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:01:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:01:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:01:02,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:01:02,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045229580] [2024-11-07 03:01:02,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045229580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:01:02,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:01:02,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:01:02,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699693080] [2024-11-07 03:01:02,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:01:02,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:01:02,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:01:02,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:01:02,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:01:02,176 INFO L87 Difference]: Start difference. First operand 1085 states and 1629 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:01:03,403 INFO L93 Difference]: Finished difference Result 3027 states and 4547 transitions. [2024-11-07 03:01:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:01:03,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-07 03:01:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:01:03,413 INFO L225 Difference]: With dead ends: 3027 [2024-11-07 03:01:03,413 INFO L226 Difference]: Without dead ends: 2048 [2024-11-07 03:01:03,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:01:03,416 INFO L432 NwaCegarLoop]: 1291 mSDtfsCounter, 1521 mSDsluCounter, 3741 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 5032 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:01:03,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 5032 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 03:01:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2024-11-07 03:01:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1132. [2024-11-07 03:01:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.5013262599469497) internal successors, (1698), 1131 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1698 transitions. [2024-11-07 03:01:03,454 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1698 transitions. Word has length 91 [2024-11-07 03:01:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:01:03,455 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1698 transitions. [2024-11-07 03:01:03,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1698 transitions. [2024-11-07 03:01:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 03:01:03,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:01:03,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:01:03,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 03:01:03,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:01:03,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:01:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2024669639, now seen corresponding path program 1 times [2024-11-07 03:01:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:01:03,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919130802] [2024-11-07 03:01:03,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:01:03,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:01:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:01:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:01:03,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:01:03,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919130802] [2024-11-07 03:01:03,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919130802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:01:03,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:01:03,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:01:03,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782071813] [2024-11-07 03:01:03,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:01:03,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:01:03,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:01:03,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:01:03,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:01:03,758 INFO L87 Difference]: Start difference. First operand 1132 states and 1698 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:01:04,508 INFO L93 Difference]: Finished difference Result 2111 states and 3169 transitions. [2024-11-07 03:01:04,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:01:04,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-11-07 03:01:04,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:01:04,514 INFO L225 Difference]: With dead ends: 2111 [2024-11-07 03:01:04,515 INFO L226 Difference]: Without dead ends: 1132 [2024-11-07 03:01:04,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 03:01:04,519 INFO L432 NwaCegarLoop]: 1281 mSDtfsCounter, 1534 mSDsluCounter, 2551 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 3832 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 03:01:04,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 3832 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 03:01:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-07 03:01:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2024-11-07 03:01:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 1.497789566755084) internal successors, (1694), 1131 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1694 transitions. [2024-11-07 03:01:04,549 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1694 transitions. Word has length 92 [2024-11-07 03:01:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:01:04,551 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1694 transitions. [2024-11-07 03:01:04,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1694 transitions. [2024-11-07 03:01:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 03:01:04,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:01:04,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:01:04,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 03:01:04,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:01:04,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:01:04,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1340403812, now seen corresponding path program 1 times [2024-11-07 03:01:04,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:01:04,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111796649] [2024-11-07 03:01:04,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:01:04,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:01:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:01:04,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:01:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:01:04,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:01:04,733 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:01:04,734 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:01:04,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 03:01:04,739 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:01:04,824 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:01:04,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:01:04 BoogieIcfgContainer [2024-11-07 03:01:04,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:01:04,831 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:01:04,832 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:01:04,832 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:01:04,833 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:00:59" (3/4) ... [2024-11-07 03:01:04,835 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:01:04,836 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:01:04,837 INFO L158 Benchmark]: Toolchain (without parser) took 11231.52ms. Allocated memory was 100.7MB in the beginning and 553.6MB in the end (delta: 453.0MB). Free memory was 75.5MB in the beginning and 262.8MB in the end (delta: -187.3MB). Peak memory consumption was 266.3MB. Max. memory is 16.1GB. [2024-11-07 03:01:04,837 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:01:04,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 647.05ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 58.9MB in the end (delta: 16.6MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2024-11-07 03:01:04,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 542.62ms. Allocated memory was 100.7MB in the beginning and 276.8MB in the end (delta: 176.2MB). Free memory was 58.9MB in the beginning and 192.4MB in the end (delta: -133.5MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2024-11-07 03:01:04,838 INFO L158 Benchmark]: Boogie Preprocessor took 515.10ms. Allocated memory is still 276.8MB. Free memory was 192.4MB in the beginning and 166.1MB in the end (delta: 26.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-11-07 03:01:04,838 INFO L158 Benchmark]: RCFGBuilder took 3796.59ms. Allocated memory was 276.8MB in the beginning and 553.6MB in the end (delta: 276.8MB). Free memory was 166.1MB in the beginning and 423.8MB in the end (delta: -257.7MB). Peak memory consumption was 128.2MB. Max. memory is 16.1GB. [2024-11-07 03:01:04,838 INFO L158 Benchmark]: TraceAbstraction took 5715.10ms. Allocated memory is still 553.6MB. Free memory was 423.8MB in the beginning and 262.8MB in the end (delta: 161.0MB). Peak memory consumption was 159.4MB. Max. memory is 16.1GB. [2024-11-07 03:01:04,839 INFO L158 Benchmark]: Witness Printer took 5.32ms. Allocated memory is still 553.6MB. Free memory was 262.8MB in the beginning and 262.8MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:01:04,840 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 647.05ms. Allocated memory is still 100.7MB. Free memory was 75.5MB in the beginning and 58.9MB in the end (delta: 16.6MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 542.62ms. Allocated memory was 100.7MB in the beginning and 276.8MB in the end (delta: 176.2MB). Free memory was 58.9MB in the beginning and 192.4MB in the end (delta: -133.5MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 515.10ms. Allocated memory is still 276.8MB. Free memory was 192.4MB in the beginning and 166.1MB in the end (delta: 26.3MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * RCFGBuilder took 3796.59ms. Allocated memory was 276.8MB in the beginning and 553.6MB in the end (delta: 276.8MB). Free memory was 166.1MB in the beginning and 423.8MB in the end (delta: -257.7MB). Peak memory consumption was 128.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5715.10ms. Allocated memory is still 553.6MB. Free memory was 423.8MB in the beginning and 262.8MB in the end (delta: 161.0MB). Peak memory consumption was 159.4MB. Max. memory is 16.1GB. * Witness Printer took 5.32ms. Allocated memory is still 553.6MB. Free memory was 262.8MB in the beginning and 262.8MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 173. 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_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_30 = 0; [L40] const SORT_3 var_59 = 0; [L41] const SORT_4 var_61 = 5; [L42] const SORT_2 var_65 = 2; [L43] const SORT_4 var_69 = 1; [L44] const SORT_2 var_75 = 4; [L45] const SORT_4 var_77 = 2; [L46] const SORT_2 var_101 = 12; [L47] const SORT_2 var_154 = 15; [L48] const SORT_2 var_169 = 10; [L50] SORT_1 input_66; [L51] SORT_1 input_76; [L52] SORT_1 input_82; [L53] SORT_1 input_106; [L54] SORT_1 input_109; [L55] SORT_1 input_110; [L56] SORT_1 input_126; [L57] SORT_1 input_145; [L58] SORT_1 input_187; [L59] SORT_1 input_208; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L61] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L62] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L63] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L64] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L65] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L66] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L67] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L68] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L69] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L70] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L71] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L72] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L73] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L74] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L75] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L76] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L77] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L78] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L79] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L80] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L81] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L82] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L83] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L84] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L85] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_101=12, var_154=15, var_169=10, var_30=0, var_59=0, var_5=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L86] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] SORT_2 init_7_arg_1 = var_5; [L89] state_6 = init_7_arg_1 [L90] SORT_2 init_9_arg_1 = var_5; [L91] state_8 = init_9_arg_1 [L92] SORT_2 init_11_arg_1 = var_5; [L93] state_10 = init_11_arg_1 [L94] SORT_2 init_13_arg_1 = var_5; [L95] state_12 = init_13_arg_1 [L96] SORT_2 init_15_arg_1 = var_5; [L97] state_14 = init_15_arg_1 [L98] SORT_2 init_17_arg_1 = var_5; [L99] state_16 = init_17_arg_1 [L100] SORT_2 init_19_arg_1 = var_5; [L101] state_18 = init_19_arg_1 [L102] SORT_2 init_21_arg_1 = var_5; [L103] state_20 = init_21_arg_1 [L104] SORT_2 init_23_arg_1 = var_5; [L105] state_22 = init_23_arg_1 [L106] SORT_2 init_25_arg_1 = var_5; [L107] state_24 = init_25_arg_1 [L108] SORT_2 init_27_arg_1 = var_5; [L109] state_26 = init_27_arg_1 [L110] SORT_2 init_29_arg_1 = var_5; [L111] state_28 = init_29_arg_1 [L112] SORT_1 init_32_arg_1 = var_30; [L113] state_31 = init_32_arg_1 [L114] SORT_1 init_34_arg_1 = var_30; [L115] state_33 = init_34_arg_1 [L116] SORT_1 init_36_arg_1 = var_30; [L117] state_35 = init_36_arg_1 [L118] SORT_1 init_38_arg_1 = var_30; [L119] state_37 = init_38_arg_1 [L120] SORT_1 init_40_arg_1 = var_30; [L121] state_39 = init_40_arg_1 [L122] SORT_1 init_42_arg_1 = var_30; [L123] state_41 = init_42_arg_1 [L124] SORT_1 init_44_arg_1 = var_30; [L125] state_43 = init_44_arg_1 [L126] SORT_1 init_46_arg_1 = var_30; [L127] state_45 = init_46_arg_1 [L128] SORT_1 init_48_arg_1 = var_30; [L129] state_47 = init_48_arg_1 [L130] SORT_1 init_50_arg_1 = var_30; [L131] state_49 = init_50_arg_1 [L132] SORT_1 init_52_arg_1 = var_30; [L133] state_51 = init_52_arg_1 [L134] SORT_1 init_54_arg_1 = var_30; [L135] state_53 = init_54_arg_1 [L136] SORT_1 init_56_arg_1 = var_30; [L137] state_55 = init_56_arg_1 [L138] SORT_1 init_58_arg_1 = var_30; [L139] state_57 = init_58_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L142] input_66 = __VERIFIER_nondet_uchar() [L143] EXPR input_66 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L143] input_66 = input_66 & mask_SORT_1 [L144] input_76 = __VERIFIER_nondet_uchar() [L145] EXPR input_76 & mask_SORT_1 VAL [input_66=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L145] input_76 = input_76 & mask_SORT_1 [L146] input_82 = __VERIFIER_nondet_uchar() [L147] EXPR input_82 & mask_SORT_1 VAL [input_66=0, input_76=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L147] input_82 = input_82 & mask_SORT_1 [L148] input_106 = __VERIFIER_nondet_uchar() [L149] EXPR input_106 & mask_SORT_1 VAL [input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L149] input_106 = input_106 & mask_SORT_1 [L150] input_109 = __VERIFIER_nondet_uchar() [L151] EXPR input_109 & mask_SORT_1 VAL [input_106=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L151] input_109 = input_109 & mask_SORT_1 [L152] input_110 = __VERIFIER_nondet_uchar() [L153] EXPR input_110 & mask_SORT_1 VAL [input_106=0, input_109=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L153] input_110 = input_110 & mask_SORT_1 [L154] input_126 = __VERIFIER_nondet_uchar() [L155] EXPR input_126 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L155] input_126 = input_126 & mask_SORT_1 [L156] input_145 = __VERIFIER_nondet_uchar() [L157] EXPR input_145 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L157] input_145 = input_145 & mask_SORT_1 [L158] input_187 = __VERIFIER_nondet_uchar() [L159] EXPR input_187 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L159] input_187 = input_187 & mask_SORT_1 [L160] input_208 = __VERIFIER_nondet_uchar() [L163] SORT_3 var_60_arg_0 = var_59; [L164] SORT_2 var_60_arg_1 = state_28; VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60_arg_0=0, var_60_arg_1=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L165] EXPR ((SORT_4)var_60_arg_0 << 8) | var_60_arg_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L165] SORT_4 var_60 = ((SORT_4)var_60_arg_0 << 8) | var_60_arg_1; [L166] EXPR var_60 & mask_SORT_4 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L166] var_60 = var_60 & mask_SORT_4 [L167] SORT_4 var_62_arg_0 = var_60; [L168] SORT_4 var_62_arg_1 = var_61; [L169] SORT_1 var_62 = var_62_arg_0 <= var_62_arg_1; [L170] SORT_1 var_63_arg_0 = ~state_57; VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_62=1, var_63_arg_0=-1, var_65=2, var_69=1, var_75=4, var_77=2] [L171] EXPR var_63_arg_0 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_62=1, var_65=2, var_69=1, var_75=4, var_77=2] [L171] var_63_arg_0 = var_63_arg_0 & mask_SORT_1 [L172] SORT_1 var_63_arg_1 = ~var_62; VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_63_arg_0=1, var_63_arg_1=-2, var_65=2, var_69=1, var_75=4, var_77=2] [L173] EXPR var_63_arg_1 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_63_arg_0=1, var_65=2, var_69=1, var_75=4, var_77=2] [L173] var_63_arg_1 = var_63_arg_1 & mask_SORT_1 [L174] EXPR var_63_arg_0 & var_63_arg_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L174] SORT_1 var_63 = var_63_arg_0 & var_63_arg_1; [L175] EXPR var_63 & mask_SORT_1 VAL [input_106=0, input_109=0, input_110=0, input_126=0, input_145=0, input_187=0, input_66=0, input_76=0, input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_6=0, state_8=0, var_101=12, var_154=15, var_169=10, var_59=0, var_60=0, var_61=5, var_65=2, var_69=1, var_75=4, var_77=2] [L175] var_63 = var_63 & mask_SORT_1 [L176] SORT_1 bad_64_arg_0 = var_63; [L177] CALL __VERIFIER_assert(!(bad_64_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1078 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3058 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3058 mSDsluCounter, 28196 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19164 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2351 IncrementalHoareTripleChecker+Invalid, 2353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 9032 mSDtfsCounter, 2351 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 920 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 531 ConstructedInterpolants, 0 QuantifiedInterpolants, 1222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 03:01:04,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.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 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:01:07,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:01:07,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 03:01:07,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:01:07,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:01:07,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:01:07,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:01:07,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:01:07,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:01:07,277 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:01:07,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:01:07,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:01:07,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:01:07,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:01:07,278 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:01:07,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:01:07,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:01:07,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:01:07,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:01:07,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:01:07,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:01:07,279 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:01:07,279 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:01:07,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:01:07,281 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:01:07,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:01:07,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:01:07,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:01:07,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:01:07,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:01:07,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:01:07,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:01:07,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:01:07,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:01:07,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:01:07,282 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:01:07,282 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:01:07,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:01:07,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:01:07,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:01:07,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:01:07,283 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 -> 2e2a2cb2c4789cd68b1190dca921718c27be66a014c5b9afd684fc837ce3e158 [2024-11-07 03:01:07,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:01:07,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:01:07,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:01:07,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:01:07,570 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:01:07,573 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.krebs.1.prop1-func-interl.c [2024-11-07 03:01:08,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:01:09,268 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:01:09,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-11-07 03:01:09,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0fbe3c57/13c623760bf94985afc851537b6d77dd/FLAGcf9a069c1 [2024-11-07 03:01:09,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0fbe3c57/13c623760bf94985afc851537b6d77dd [2024-11-07 03:01:09,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:01:09,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:01:09,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:01:09,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:01:09,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:01:09,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:01:09" (1/1) ... [2024-11-07 03:01:09,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa166b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:09, skipping insertion in model container [2024-11-07 03:01:09,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:01:09" (1/1) ... [2024-11-07 03:01:09,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:01:09,556 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.krebs.1.prop1-func-interl.c[1172,1185] [2024-11-07 03:01:09,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:01:09,861 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:01:09,871 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.krebs.1.prop1-func-interl.c[1172,1185] [2024-11-07 03:01:09,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:01:10,013 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:01:10,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10 WrapperNode [2024-11-07 03:01:10,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:01:10,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:01:10,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:01:10,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:01:10,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10" (1/1) ... [2024-11-07 03:01:10,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10" (1/1) ... [2024-11-07 03:01:10,144 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1116 [2024-11-07 03:01:10,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:01:10,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:01:10,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:01:10,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:01:10,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10" (1/1) ... [2024-11-07 03:01:10,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10" (1/1) ... [2024-11-07 03:01:10,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10" (1/1) ... [2024-11-07 03:01:10,218 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 03:01:10,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10" (1/1) ... [2024-11-07 03:01:10,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10" (1/1) ... [2024-11-07 03:01:10,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10" (1/1) ... [2024-11-07 03:01:10,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10" (1/1) ... [2024-11-07 03:01:10,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10" (1/1) ... [2024-11-07 03:01:10,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10" (1/1) ... [2024-11-07 03:01:10,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:01:10,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:01:10,292 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:01:10,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:01:10,293 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10" (1/1) ... [2024-11-07 03:01:10,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:01:10,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:01:10,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 03:01:10,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 03:01:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:01:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:01:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:01:10,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:01:10,586 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:01:10,587 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:01:11,535 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-11-07 03:01:11,535 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:01:11,545 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:01:11,546 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:01:11,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:01:11 BoogieIcfgContainer [2024-11-07 03:01:11,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:01:11,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:01:11,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:01:11,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:01:11,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:01:09" (1/3) ... [2024-11-07 03:01:11,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eedc01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:01:11, skipping insertion in model container [2024-11-07 03:01:11,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:01:10" (2/3) ... [2024-11-07 03:01:11,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eedc01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:01:11, skipping insertion in model container [2024-11-07 03:01:11,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:01:11" (3/3) ... [2024-11-07 03:01:11,558 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.1.prop1-func-interl.c [2024-11-07 03:01:11,572 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:01:11,572 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:01:11,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:01:11,638 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;@55db8b09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:01:11,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:01:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:11,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 03:01:11,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:01:11,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 03:01:11,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:01:11,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:01:11,655 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 03:01:11,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:01:11,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859731789] [2024-11-07 03:01:11,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:01:11,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:01:11,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:01:11,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:01:11,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 03:01:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:01:11,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 03:01:11,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:01:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:01:12,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:01:12,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:01:12,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859731789] [2024-11-07 03:01:12,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859731789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:01:12,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:01:12,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:01:12,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147782620] [2024-11-07 03:01:12,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:01:12,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:01:12,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:01:12,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:01:12,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:01:12,148 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:01:12,237 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-07 03:01:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:01:12,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 03:01:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:01:12,245 INFO L225 Difference]: With dead ends: 18 [2024-11-07 03:01:12,245 INFO L226 Difference]: Without dead ends: 10 [2024-11-07 03:01:12,247 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 03:01:12,251 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 03:01:12,251 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 03:01:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-07 03:01:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-07 03:01:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 03:01:12,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 03:01:12,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:01:12,275 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 03:01:12,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 03:01:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 03:01:12,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:01:12,276 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 03:01:12,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 03:01:12,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:01:12,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:01:12,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:01:12,481 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 03:01:12,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:01:12,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052738877] [2024-11-07 03:01:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:01:12,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:01:12,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:01:12,486 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:01:12,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 03:01:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:01:12,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 03:01:12,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:01:13,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:01:13,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:01:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:01:23,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:01:23,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052738877] [2024-11-07 03:01:23,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052738877] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:01:23,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:01:23,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-07 03:01:23,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520634400] [2024-11-07 03:01:23,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:01:23,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 03:01:23,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:01:23,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 03:01:23,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=60, Unknown=2, NotChecked=0, Total=90 [2024-11-07 03:01:23,023 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:01:26,248 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-07 03:01:26,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:01:26,248 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-07 03:01:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:01:26,249 INFO L225 Difference]: With dead ends: 18 [2024-11-07 03:01:26,249 INFO L226 Difference]: Without dead ends: 16 [2024-11-07 03:01:26,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=73, Invalid=135, Unknown=2, NotChecked=0, Total=210 [2024-11-07 03:01:26,250 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 03:01:26,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 03:01:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-07 03:01:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-07 03:01:26,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-07 03:01:26,254 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-07 03:01:26,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:01:26,254 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-07 03:01:26,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-07 03:01:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 03:01:26,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:01:26,255 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-07 03:01:26,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 03:01:26,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:01:26,456 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:01:26,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:01:26,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-07 03:01:26,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:01:26,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217788321] [2024-11-07 03:01:26,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 03:01:26,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:01:26,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:01:26,461 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:01:26,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 03:01:27,049 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 03:01:27,050 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 03:01:27,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-07 03:01:27,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:01:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:01:33,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:01:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:01:46,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:01:46,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217788321] [2024-11-07 03:01:46,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217788321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:01:46,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:01:46,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-07 03:01:46,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104358975] [2024-11-07 03:01:46,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:01:46,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 03:01:46,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:01:46,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 03:01:46,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-11-07 03:01:46,382 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:01:54,203 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-11-07 03:01:54,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 03:01:54,204 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-07 03:01:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:01:54,204 INFO L225 Difference]: With dead ends: 27 [2024-11-07 03:01:54,204 INFO L226 Difference]: Without dead ends: 25 [2024-11-07 03:01:54,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=241, Invalid=515, Unknown=0, NotChecked=0, Total=756 [2024-11-07 03:01:54,205 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 03:01:54,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 38 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 03:01:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-07 03:01:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-07 03:01:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-11-07 03:01:54,213 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 14 [2024-11-07 03:01:54,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:01:54,213 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-11-07 03:01:54,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:01:54,213 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-11-07 03:01:54,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 03:01:54,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:01:54,214 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2024-11-07 03:01:54,222 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 (4)] Ended with exit code 0 [2024-11-07 03:01:54,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:01:54,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:01:54,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:01:54,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1845955269, now seen corresponding path program 3 times [2024-11-07 03:01:54,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:01:54,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956439640] [2024-11-07 03:01:54,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 03:01:54,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:01:54,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:01:54,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:01:54,421 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 (5)] Waiting until timeout for monitored process [2024-11-07 03:01:56,118 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-07 03:01:56,119 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 03:01:56,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-07 03:01:56,159 INFO L278 TraceCheckSpWp]: Computing forward predicates...