./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.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', '45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.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 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:48:08,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:48:08,687 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:48:08,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:48:08,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:48:08,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:48:08,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:48:08,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:48:08,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:48:08,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:48:08,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:48:08,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:48:08,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:48:08,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:48:08,706 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:48:08,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:48:08,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:48:08,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:48:08,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:48:08,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:48:08,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:48:08,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:48:08,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:48:08,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:48:08,707 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:48:08,707 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:48:08,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:48:08,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:48:08,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:48:08,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:48:08,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:48:08,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:48:08,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:48:08,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:48:08,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:48:08,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:48:08,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:48:08,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:48:08,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:48:08,708 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 -> 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 [2024-11-07 03:48:08,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:48:08,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:48:08,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:48:08,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:48:08,936 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:48:08,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-11-07 03:48:10,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:48:10,277 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:48:10,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-11-07 03:48:10,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79b0b442e/6492b42c52814192af16cd8e9502eeae/FLAGf26cf25b8 [2024-11-07 03:48:10,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79b0b442e/6492b42c52814192af16cd8e9502eeae [2024-11-07 03:48:10,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:48:10,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:48:10,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:48:10,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:48:10,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:48:10,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:48:10" (1/1) ... [2024-11-07 03:48:10,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a2d180e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:10, skipping insertion in model container [2024-11-07 03:48:10,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:48:10" (1/1) ... [2024-11-07 03:48:10,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:48:10,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c[1258,1271] [2024-11-07 03:48:10,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:48:10,515 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:48:10,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c[1258,1271] [2024-11-07 03:48:10,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:48:10,577 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:48:10,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:10 WrapperNode [2024-11-07 03:48:10,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:48:10,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:48:10,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:48:10,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:48:10,582 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:48:10" (1/1) ... [2024-11-07 03:48:10,600 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:48:10" (1/1) ... [2024-11-07 03:48:10,670 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 932 [2024-11-07 03:48:10,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:48:10,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:48:10,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:48:10,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:48:10,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:10" (1/1) ... [2024-11-07 03:48:10,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:10" (1/1) ... [2024-11-07 03:48:10,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:10" (1/1) ... [2024-11-07 03:48:10,727 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:48:10,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:10" (1/1) ... [2024-11-07 03:48:10,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:10" (1/1) ... [2024-11-07 03:48:10,768 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:10" (1/1) ... [2024-11-07 03:48:10,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:10" (1/1) ... [2024-11-07 03:48:10,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:10" (1/1) ... [2024-11-07 03:48:10,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:10" (1/1) ... [2024-11-07 03:48:10,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:48:10,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:48:10,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:48:10,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:48:10,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:10" (1/1) ... [2024-11-07 03:48:10,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:48:10,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:48:10,836 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:48:10,838 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:48:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:48:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:48:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:48:10,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:48:10,994 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:48:10,995 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:48:11,832 INFO L? ?]: Removed 452 outVars from TransFormulas that were not future-live. [2024-11-07 03:48:11,832 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:48:11,843 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:48:11,845 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:48:11,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:48:11 BoogieIcfgContainer [2024-11-07 03:48:11,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:48:11,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:48:11,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:48:11,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:48:11,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:48:10" (1/3) ... [2024-11-07 03:48:11,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105b5124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:48:11, skipping insertion in model container [2024-11-07 03:48:11,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:10" (2/3) ... [2024-11-07 03:48:11,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105b5124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:48:11, skipping insertion in model container [2024-11-07 03:48:11,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:48:11" (3/3) ... [2024-11-07 03:48:11,855 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-11-07 03:48:11,865 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:48:11,866 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:48:11,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:48:11,919 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;@323bbbf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:48:11,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:48:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 240 states have (on average 1.4958333333333333) internal successors, (359), 241 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have 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:48:11,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 03:48:11,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:48:11,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:48:11,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:48:11,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:48:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash -171947488, now seen corresponding path program 1 times [2024-11-07 03:48:11,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:48:11,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902741452] [2024-11-07 03:48:11,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:48:11,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:48:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:48:13,220 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:48:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:48:13,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902741452] [2024-11-07 03:48:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902741452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:48:13,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:48:13,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:48:13,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319944486] [2024-11-07 03:48:13,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:48:13,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:48:13,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:48:13,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:48:13,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:48:13,245 INFO L87 Difference]: Start difference. First operand has 242 states, 240 states have (on average 1.4958333333333333) internal successors, (359), 241 states have internal predecessors, (359), 0 states have call successors, (0), 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 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:48:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:48:13,305 INFO L93 Difference]: Finished difference Result 411 states and 612 transitions. [2024-11-07 03:48:13,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:48:13,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-07 03:48:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:48:13,316 INFO L225 Difference]: With dead ends: 411 [2024-11-07 03:48:13,316 INFO L226 Difference]: Without dead ends: 239 [2024-11-07 03:48:13,318 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:48:13,322 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 18 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:48:13,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1019 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:48:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-07 03:48:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-11-07 03:48:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.4873949579831933) internal successors, (354), 238 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have 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:48:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 354 transitions. [2024-11-07 03:48:13,363 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 354 transitions. Word has length 111 [2024-11-07 03:48:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:48:13,363 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 354 transitions. [2024-11-07 03:48:13,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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:48:13,363 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 354 transitions. [2024-11-07 03:48:13,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-07 03:48:13,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:48:13,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:48:13,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:48:13,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:48:13,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:48:13,367 INFO L85 PathProgramCache]: Analyzing trace with hash 863630480, now seen corresponding path program 1 times [2024-11-07 03:48:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:48:13,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951695593] [2024-11-07 03:48:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:48:13,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:48:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:48:13,793 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:48:13,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:48:13,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951695593] [2024-11-07 03:48:13,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951695593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:48:13,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:48:13,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:48:13,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534814786] [2024-11-07 03:48:13,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:48:13,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:48:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:48:13,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:48:13,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:48:13,797 INFO L87 Difference]: Start difference. First operand 239 states and 354 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have 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:48:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:48:13,829 INFO L93 Difference]: Finished difference Result 243 states and 358 transitions. [2024-11-07 03:48:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:48:13,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-11-07 03:48:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:48:13,831 INFO L225 Difference]: With dead ends: 243 [2024-11-07 03:48:13,834 INFO L226 Difference]: Without dead ends: 241 [2024-11-07 03:48:13,834 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:48:13,835 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 0 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:48:13,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1050 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:48:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-07 03:48:13,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-11-07 03:48:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.4833333333333334) internal successors, (356), 240 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have 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:48:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 356 transitions. [2024-11-07 03:48:13,846 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 356 transitions. Word has length 112 [2024-11-07 03:48:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:48:13,846 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 356 transitions. [2024-11-07 03:48:13,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have 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:48:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 356 transitions. [2024-11-07 03:48:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 03:48:13,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:48:13,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:48:13,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:48:13,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:48:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:48:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1004436946, now seen corresponding path program 1 times [2024-11-07 03:48:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:48:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228164757] [2024-11-07 03:48:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:48:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:48:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:48:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:48:14,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:48:14,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228164757] [2024-11-07 03:48:14,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228164757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:48:14,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:48:14,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:48:14,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683940981] [2024-11-07 03:48:14,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:48:14,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:48:14,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:48:14,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:48:14,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:48:14,106 INFO L87 Difference]: Start difference. First operand 241 states and 356 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have 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:48:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:48:14,132 INFO L93 Difference]: Finished difference Result 414 states and 611 transitions. [2024-11-07 03:48:14,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:48:14,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-11-07 03:48:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:48:14,135 INFO L225 Difference]: With dead ends: 414 [2024-11-07 03:48:14,135 INFO L226 Difference]: Without dead ends: 243 [2024-11-07 03:48:14,136 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:48:14,137 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 0 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1046 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:48:14,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1046 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:48:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-07 03:48:14,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2024-11-07 03:48:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 1.4793388429752066) internal successors, (358), 242 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have 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:48:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 358 transitions. [2024-11-07 03:48:14,152 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 358 transitions. Word has length 113 [2024-11-07 03:48:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:48:14,152 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 358 transitions. [2024-11-07 03:48:14,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have 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:48:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 358 transitions. [2024-11-07 03:48:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 03:48:14,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:48:14,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:48:14,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:48:14,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:48:14,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:48:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash -25190999, now seen corresponding path program 1 times [2024-11-07 03:48:14,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:48:14,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120643929] [2024-11-07 03:48:14,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:48:14,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:48:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:48:14,929 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:48:14,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:48:14,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120643929] [2024-11-07 03:48:14,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120643929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:48:14,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:48:14,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:48:14,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047529602] [2024-11-07 03:48:14,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:48:14,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:48:14,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:48:14,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:48:14,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:48:14,930 INFO L87 Difference]: Start difference. First operand 243 states and 358 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have 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:48:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:48:15,033 INFO L93 Difference]: Finished difference Result 420 states and 618 transitions. [2024-11-07 03:48:15,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:48:15,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-07 03:48:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:48:15,037 INFO L225 Difference]: With dead ends: 420 [2024-11-07 03:48:15,037 INFO L226 Difference]: Without dead ends: 247 [2024-11-07 03:48:15,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:48:15,038 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 254 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:48:15,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1647 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:48:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-07 03:48:15,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2024-11-07 03:48:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.473469387755102) internal successors, (361), 245 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have 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:48:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 361 transitions. [2024-11-07 03:48:15,050 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 361 transitions. Word has length 114 [2024-11-07 03:48:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:48:15,050 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 361 transitions. [2024-11-07 03:48:15,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have 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:48:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 361 transitions. [2024-11-07 03:48:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 03:48:15,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:48:15,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:48:15,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:48:15,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:48:15,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:48:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash 783624821, now seen corresponding path program 1 times [2024-11-07 03:48:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:48:15,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376987716] [2024-11-07 03:48:15,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:48:15,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:48:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:48:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 03:48:15,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:48:15,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376987716] [2024-11-07 03:48:15,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376987716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:48:15,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:48:15,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:48:15,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353119588] [2024-11-07 03:48:15,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:48:15,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:48:15,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:48:15,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:48:15,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:48:15,715 INFO L87 Difference]: Start difference. First operand 246 states and 361 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have 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:48:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:48:15,764 INFO L93 Difference]: Finished difference Result 431 states and 630 transitions. [2024-11-07 03:48:15,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:48:15,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-11-07 03:48:15,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:48:15,765 INFO L225 Difference]: With dead ends: 431 [2024-11-07 03:48:15,765 INFO L226 Difference]: Without dead ends: 255 [2024-11-07 03:48:15,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:48:15,766 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 5 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:48:15,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1719 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:48:15,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-07 03:48:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 251. [2024-11-07 03:48:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.468) internal successors, (367), 250 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have 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:48:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 367 transitions. [2024-11-07 03:48:15,776 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 367 transitions. Word has length 115 [2024-11-07 03:48:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:48:15,777 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 367 transitions. [2024-11-07 03:48:15,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have 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:48:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 367 transitions. [2024-11-07 03:48:15,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 03:48:15,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:48:15,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:48:15,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 03:48:15,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:48:15,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:48:15,779 INFO L85 PathProgramCache]: Analyzing trace with hash -461573994, now seen corresponding path program 1 times [2024-11-07 03:48:15,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:48:15,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435780528] [2024-11-07 03:48:15,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:48:15,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:48:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:48:16,821 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:48:16,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:48:16,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435780528] [2024-11-07 03:48:16,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435780528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:48:16,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:48:16,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:48:16,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154749505] [2024-11-07 03:48:16,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:48:16,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:48:16,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:48:16,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:48:16,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:48:16,824 INFO L87 Difference]: Start difference. First operand 251 states and 367 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have 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:48:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:48:17,005 INFO L93 Difference]: Finished difference Result 464 states and 674 transitions. [2024-11-07 03:48:17,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:48:17,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-11-07 03:48:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:48:17,007 INFO L225 Difference]: With dead ends: 464 [2024-11-07 03:48:17,009 INFO L226 Difference]: Without dead ends: 283 [2024-11-07 03:48:17,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:48:17,010 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 313 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:48:17,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1975 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:48:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-07 03:48:17,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 278. [2024-11-07 03:48:17,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.4620938628158844) internal successors, (405), 277 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have 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:48:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 405 transitions. [2024-11-07 03:48:17,017 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 405 transitions. Word has length 115 [2024-11-07 03:48:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:48:17,018 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 405 transitions. [2024-11-07 03:48:17,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have 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:48:17,018 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 405 transitions. [2024-11-07 03:48:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 03:48:17,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:48:17,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:48:17,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 03:48:17,019 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:48:17,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:48:17,019 INFO L85 PathProgramCache]: Analyzing trace with hash 140653864, now seen corresponding path program 1 times [2024-11-07 03:48:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:48:17,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371995617] [2024-11-07 03:48:17,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:48:17,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:48:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:48:17,588 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:48:17,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:48:17,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371995617] [2024-11-07 03:48:17,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371995617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:48:17,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:48:17,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 03:48:17,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811801165] [2024-11-07 03:48:17,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:48:17,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 03:48:17,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:48:17,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 03:48:17,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:48:17,592 INFO L87 Difference]: Start difference. First operand 278 states and 405 transitions. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:48:17,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:48:17,920 INFO L93 Difference]: Finished difference Result 662 states and 961 transitions. [2024-11-07 03:48:17,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 03:48:17,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-07 03:48:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:48:17,922 INFO L225 Difference]: With dead ends: 662 [2024-11-07 03:48:17,922 INFO L226 Difference]: Without dead ends: 280 [2024-11-07 03:48:17,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-07 03:48:17,923 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 502 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 2506 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:48:17,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 2506 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:48:17,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-07 03:48:17,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2024-11-07 03:48:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.4551971326164874) internal successors, (406), 279 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have 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:48:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 406 transitions. [2024-11-07 03:48:17,930 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 406 transitions. Word has length 116 [2024-11-07 03:48:17,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:48:17,930 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 406 transitions. [2024-11-07 03:48:17,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:48:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 406 transitions. [2024-11-07 03:48:17,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 03:48:17,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:48:17,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:48:17,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 03:48:17,932 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:48:17,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:48:17,932 INFO L85 PathProgramCache]: Analyzing trace with hash 964654761, now seen corresponding path program 1 times [2024-11-07 03:48:17,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:48:17,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759113375] [2024-11-07 03:48:17,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:48:17,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:48:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:48:18,620 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:48:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:48:18,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759113375] [2024-11-07 03:48:18,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759113375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:48:18,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:48:18,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:48:18,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99654138] [2024-11-07 03:48:18,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:48:18,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:48:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:48:18,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:48:18,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:48:18,623 INFO L87 Difference]: Start difference. First operand 280 states and 406 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:48:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:48:18,722 INFO L93 Difference]: Finished difference Result 554 states and 803 transitions. [2024-11-07 03:48:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:48:18,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-11-07 03:48:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:48:18,725 INFO L225 Difference]: With dead ends: 554 [2024-11-07 03:48:18,726 INFO L226 Difference]: Without dead ends: 344 [2024-11-07 03:48:18,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:48:18,726 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 426 mSDsluCounter, 2012 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:48:18,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 2357 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:48:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-07 03:48:18,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 318. [2024-11-07 03:48:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.4574132492113565) internal successors, (462), 317 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:48:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 462 transitions. [2024-11-07 03:48:18,732 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 462 transitions. Word has length 116 [2024-11-07 03:48:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:48:18,732 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 462 transitions. [2024-11-07 03:48:18,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 9 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have 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:48:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 462 transitions. [2024-11-07 03:48:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 03:48:18,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:48:18,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:48:18,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 03:48:18,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:48:18,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:48:18,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1789735299, now seen corresponding path program 1 times [2024-11-07 03:48:18,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:48:18,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709919942] [2024-11-07 03:48:18,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:48:18,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:48:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:48:18,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:48:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:48:19,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:48:19,007 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:48:19,007 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:48:19,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 03:48:19,010 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:48:19,087 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:48:19,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:48:19 BoogieIcfgContainer [2024-11-07 03:48:19,093 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:48:19,094 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:48:19,094 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:48:19,094 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:48:19,094 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:48:11" (3/4) ... [2024-11-07 03:48:19,096 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:48:19,096 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:48:19,097 INFO L158 Benchmark]: Toolchain (without parser) took 8786.09ms. Allocated memory was 109.1MB in the beginning and 478.2MB in the end (delta: 369.1MB). Free memory was 85.0MB in the beginning and 375.1MB in the end (delta: -290.1MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2024-11-07 03:48:19,097 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:48:19,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.53ms. Allocated memory is still 109.1MB. Free memory was 84.8MB in the beginning and 63.3MB in the end (delta: 21.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:48:19,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.37ms. Allocated memory is still 109.1MB. Free memory was 63.3MB in the beginning and 44.4MB in the end (delta: 18.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 03:48:19,097 INFO L158 Benchmark]: Boogie Preprocessor took 141.23ms. Allocated memory is still 109.1MB. Free memory was 44.4MB in the beginning and 71.5MB in the end (delta: -27.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-11-07 03:48:19,099 INFO L158 Benchmark]: RCFGBuilder took 1032.00ms. Allocated memory is still 109.1MB. Free memory was 71.5MB in the beginning and 66.9MB in the end (delta: 4.6MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2024-11-07 03:48:19,099 INFO L158 Benchmark]: TraceAbstraction took 7246.11ms. Allocated memory was 109.1MB in the beginning and 478.2MB in the end (delta: 369.1MB). Free memory was 66.3MB in the beginning and 375.2MB in the end (delta: -308.9MB). Peak memory consumption was 284.5MB. Max. memory is 16.1GB. [2024-11-07 03:48:19,099 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 478.2MB. Free memory was 375.2MB in the beginning and 375.1MB in the end (delta: 80.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:48:19,100 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.30ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.53ms. Allocated memory is still 109.1MB. Free memory was 84.8MB in the beginning and 63.3MB in the end (delta: 21.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.37ms. Allocated memory is still 109.1MB. Free memory was 63.3MB in the beginning and 44.4MB in the end (delta: 18.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.23ms. Allocated memory is still 109.1MB. Free memory was 44.4MB in the beginning and 71.5MB in the end (delta: -27.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1032.00ms. Allocated memory is still 109.1MB. Free memory was 71.5MB in the beginning and 66.9MB in the end (delta: 4.6MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7246.11ms. Allocated memory was 109.1MB in the beginning and 478.2MB in the end (delta: 369.1MB). Free memory was 66.3MB in the beginning and 375.2MB in the end (delta: -308.9MB). Peak memory consumption was 284.5MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 478.2MB. Free memory was 375.2MB in the beginning and 375.1MB in the end (delta: 80.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 325, overapproximation of bitwiseAnd at line 332. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 6); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (6 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L35] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 2); [L36] const SORT_21 msb_SORT_21 = (SORT_21)1 << (2 - 1); [L38] const SORT_43 mask_SORT_43 = (SORT_43)-1 >> (sizeof(SORT_43) * 8 - 5); [L39] const SORT_43 msb_SORT_43 = (SORT_43)1 << (5 - 1); [L41] const SORT_21 var_22 = 0; [L42] const SORT_21 var_23 = 1; [L43] const SORT_1 var_24 = 0; [L44] const SORT_3 var_28 = 1; [L45] const SORT_3 var_34 = 0; [L46] const SORT_43 var_45 = 31; [L47] const SORT_21 var_49 = 2; [L48] const SORT_21 var_66 = 3; [L49] const SORT_6 var_89 = 0; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_6 input_7; [L55] SORT_3 input_8; [L56] SORT_6 input_9; [L57] SORT_1 input_10; [L58] SORT_1 input_11; [L59] SORT_1 input_12; [L60] SORT_3 input_13; [L61] SORT_3 input_14; [L62] SORT_3 input_15; [L63] SORT_3 input_16; [L64] SORT_3 input_17; [L65] SORT_3 input_18; [L66] SORT_3 input_19; [L67] SORT_3 input_20; [L68] SORT_3 input_119; [L69] SORT_3 input_123; [L70] SORT_1 input_125; [L71] SORT_3 input_127; [L72] SORT_21 input_130; [L73] SORT_3 input_132; [L74] SORT_6 input_135; [L75] SORT_3 input_137; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L77] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L78] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L79] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L80] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L81] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L82] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L83] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L84] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L85] SORT_3 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L86] SORT_3 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L87] SORT_3 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L88] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L89] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, mask_SORT_6=-1, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L89] SORT_6 state_92 = __VERIFIER_nondet_uint() & mask_SORT_6; [L90] EXPR __VERIFIER_nondet_uint() & mask_SORT_6 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L90] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L91] SORT_1 state_115 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L92] SORT_3 state_117 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, var_22=0, var_23=1, var_24=0, var_28=1, var_34=0, var_45=31, var_49=2, var_66=3, var_89=0] [L93] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] SORT_1 init_26_arg_1 = var_24; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_31_arg_1 = var_24; [L98] state_30 = init_31_arg_1 [L99] SORT_3 init_36_arg_1 = var_34; [L100] state_35 = init_36_arg_1 [L101] SORT_3 init_40_arg_1 = var_34; [L102] state_39 = init_40_arg_1 [L103] SORT_1 init_52_arg_1 = var_24; [L104] state_51 = init_52_arg_1 [L105] SORT_3 init_56_arg_1 = var_34; [L106] state_55 = init_56_arg_1 [L107] SORT_3 init_60_arg_1 = var_34; [L108] state_59 = init_60_arg_1 [L109] SORT_1 init_69_arg_1 = var_24; [L110] state_68 = init_69_arg_1 [L111] SORT_3 init_73_arg_1 = var_34; [L112] state_72 = init_73_arg_1 [L113] SORT_3 init_77_arg_1 = var_34; [L114] state_76 = init_77_arg_1 [L115] SORT_3 init_81_arg_1 = var_34; [L116] state_80 = init_81_arg_1 [L117] SORT_6 init_91_arg_1 = var_89; [L118] state_90 = init_91_arg_1 [L119] SORT_6 init_93_arg_1 = var_89; [L120] state_92 = init_93_arg_1 [L121] SORT_6 init_97_arg_1 = var_89; [L122] state_96 = init_97_arg_1 [L123] SORT_1 init_116_arg_1 = var_24; [L124] state_115 = init_116_arg_1 [L125] SORT_3 init_118_arg_1 = var_34; [L126] state_117 = init_118_arg_1 [L127] SORT_3 init_122_arg_1 = var_34; [L128] state_121 = init_122_arg_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] EXPR input_4 & mask_SORT_3 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] EXPR input_5 & mask_SORT_1 VAL [input_4=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] EXPR input_8 & mask_SORT_3 VAL [input_4=0, input_5=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] EXPR input_10 & mask_SORT_1 VAL [input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] EXPR input_11 & mask_SORT_1 VAL [input_10=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] EXPR input_14 & mask_SORT_3 VAL [input_10=0, input_11=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] EXPR input_16 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] EXPR input_17 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] EXPR input_18 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] EXPR input_19 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_119 = __VERIFIER_nondet_uchar() [L159] input_123 = __VERIFIER_nondet_uchar() [L160] input_125 = __VERIFIER_nondet_uchar() [L161] input_127 = __VERIFIER_nondet_uchar() [L162] input_130 = __VERIFIER_nondet_uchar() [L163] input_132 = __VERIFIER_nondet_uchar() [L164] input_135 = __VERIFIER_nondet_uint() [L165] input_137 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_27_arg_0 = state_25; [L169] SORT_3 var_27 = var_27_arg_0 >> 5; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L170] EXPR var_27 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L170] var_27 = var_27 & mask_SORT_3 [L171] SORT_3 var_67_arg_0 = var_27; [L172] SORT_3 var_67_arg_1 = var_28; [L173] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L174] SORT_1 var_70_arg_0 = state_25; [L175] SORT_1 var_70_arg_1 = state_68; [L176] SORT_3 var_70 = var_70_arg_0 == var_70_arg_1; [L177] SORT_3 var_71_arg_0 = var_67; [L178] SORT_3 var_71_arg_1 = var_70; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_71_arg_0=0, var_71_arg_1=1, var_89=0] [L179] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L179] SORT_3 var_71 = var_71_arg_0 & var_71_arg_1; [L180] SORT_3 var_74_arg_0 = state_72; [L181] SORT_3 var_74_arg_1 = var_28; [L182] SORT_3 var_74 = var_74_arg_0 != var_74_arg_1; [L183] SORT_3 var_75_arg_0 = var_71; [L184] SORT_3 var_75_arg_1 = var_74; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_75_arg_0=0, var_75_arg_1=1, var_89=0] [L185] EXPR var_75_arg_0 & var_75_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L185] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L186] SORT_3 var_78_arg_0 = state_76; [L187] SORT_3 var_78_arg_1 = var_28; [L188] SORT_3 var_78 = var_78_arg_0 == var_78_arg_1; [L189] SORT_3 var_79_arg_0 = var_75; [L190] SORT_3 var_79_arg_1 = var_78; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_79_arg_0=0, var_79_arg_1=0, var_89=0] [L191] EXPR var_79_arg_0 & var_79_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L191] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L192] SORT_3 var_82_arg_0 = state_80; [L193] SORT_3 var_82_arg_1 = var_28; [L194] SORT_3 var_82 = var_82_arg_0 == var_82_arg_1; [L195] SORT_3 var_83_arg_0 = var_79; [L196] SORT_3 var_83_arg_1 = var_82; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_83_arg_0=0, var_83_arg_1=0, var_89=0] [L197] EXPR var_83_arg_0 & var_83_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L197] SORT_3 var_83 = var_83_arg_0 & var_83_arg_1; [L198] SORT_1 var_44_arg_0 = state_25; [L199] SORT_43 var_44 = var_44_arg_0 >> 0; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_83=0, var_89=0] [L200] EXPR var_44 & mask_SORT_43 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_45=31, var_49=2, var_66=3, var_83=0, var_89=0] [L200] var_44 = var_44 & mask_SORT_43 [L201] SORT_43 var_84_arg_0 = var_44; [L202] SORT_43 var_84_arg_1 = var_45; [L203] SORT_3 var_84 = var_84_arg_0 != var_84_arg_1; [L204] SORT_3 var_85_arg_0 = var_83; [L205] SORT_3 var_85_arg_1 = var_84; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85_arg_0=0, var_85_arg_1=1, var_89=0] [L206] EXPR var_85_arg_0 & var_85_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L206] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L207] EXPR var_85 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L207] var_85 = var_85 & mask_SORT_3 [L208] SORT_3 var_50_arg_0 = var_27; [L209] SORT_3 var_50_arg_1 = var_28; [L210] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L211] SORT_1 var_53_arg_0 = state_25; [L212] SORT_1 var_53_arg_1 = state_51; [L213] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L214] SORT_3 var_54_arg_0 = var_50; [L215] SORT_3 var_54_arg_1 = var_53; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_54_arg_0=0, var_54_arg_1=1, var_66=3, var_85=0, var_89=0] [L216] EXPR var_54_arg_0 & var_54_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L216] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L217] SORT_3 var_57_arg_0 = state_55; [L218] SORT_3 var_57_arg_1 = var_28; [L219] SORT_3 var_57 = var_57_arg_0 == var_57_arg_1; [L220] SORT_3 var_58_arg_0 = var_54; [L221] SORT_3 var_58_arg_1 = var_57; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_58_arg_0=0, var_58_arg_1=0, var_66=3, var_85=0, var_89=0] [L222] EXPR var_58_arg_0 & var_58_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L222] SORT_3 var_58 = var_58_arg_0 & var_58_arg_1; [L223] SORT_3 var_61_arg_0 = state_59; [L224] SORT_3 var_61_arg_1 = var_28; [L225] SORT_3 var_61 = var_61_arg_0 == var_61_arg_1; [L226] SORT_3 var_62_arg_0 = var_58; [L227] SORT_3 var_62_arg_1 = var_61; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_62_arg_0=0, var_62_arg_1=0, var_66=3, var_85=0, var_89=0] [L228] EXPR var_62_arg_0 & var_62_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L228] SORT_3 var_62 = var_62_arg_0 & var_62_arg_1; [L229] SORT_43 var_63_arg_0 = var_44; [L230] SORT_43 var_63_arg_1 = var_45; [L231] SORT_3 var_63 = var_63_arg_0 != var_63_arg_1; [L232] SORT_3 var_64_arg_0 = var_62; [L233] SORT_3 var_64_arg_1 = var_63; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_64_arg_0=0, var_64_arg_1=1, var_66=3, var_85=0, var_89=0] [L234] EXPR var_64_arg_0 & var_64_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L234] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L235] EXPR var_64 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_27=0, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_85=0, var_89=0] [L235] var_64 = var_64 & mask_SORT_3 [L236] SORT_3 var_29_arg_0 = var_27; [L237] SORT_3 var_29_arg_1 = var_28; [L238] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L239] SORT_1 var_32_arg_0 = state_25; [L240] SORT_1 var_32_arg_1 = state_30; [L241] SORT_3 var_32 = var_32_arg_0 == var_32_arg_1; [L242] SORT_3 var_33_arg_0 = var_29; [L243] SORT_3 var_33_arg_1 = var_32; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_33_arg_0=0, var_33_arg_1=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L244] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L244] SORT_3 var_33 = var_33_arg_0 & var_33_arg_1; [L245] SORT_3 var_37_arg_0 = state_35; [L246] SORT_3 var_37_arg_1 = var_28; [L247] SORT_3 var_37 = var_37_arg_0 == var_37_arg_1; [L248] SORT_3 var_38_arg_0 = var_33; [L249] SORT_3 var_38_arg_1 = var_37; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_38_arg_0=0, var_38_arg_1=0, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L250] EXPR var_38_arg_0 & var_38_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L250] SORT_3 var_38 = var_38_arg_0 & var_38_arg_1; [L251] SORT_3 var_41_arg_0 = state_39; [L252] SORT_3 var_41_arg_1 = var_28; [L253] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L254] SORT_3 var_42_arg_0 = var_38; [L255] SORT_3 var_42_arg_1 = var_41; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_42_arg_0=0, var_42_arg_1=0, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L256] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L256] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L257] SORT_43 var_46_arg_0 = var_44; [L258] SORT_43 var_46_arg_1 = var_45; [L259] SORT_3 var_46 = var_46_arg_0 != var_46_arg_1; [L260] SORT_3 var_47_arg_0 = var_42; [L261] SORT_3 var_47_arg_1 = var_46; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_47_arg_0=0, var_47_arg_1=1, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L262] EXPR var_47_arg_0 & var_47_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L262] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L263] EXPR var_47 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_64=0, var_66=3, var_85=0, var_89=0] [L263] var_47 = var_47 & mask_SORT_3 [L264] SORT_3 var_48_arg_0 = var_47; [L265] SORT_21 var_48_arg_1 = var_23; [L266] SORT_21 var_48_arg_2 = var_22; [L267] SORT_21 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L268] SORT_3 var_65_arg_0 = var_64; [L269] SORT_21 var_65_arg_1 = var_49; [L270] SORT_21 var_65_arg_2 = var_48; [L271] SORT_21 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L272] SORT_3 var_86_arg_0 = var_85; [L273] SORT_21 var_86_arg_1 = var_66; [L274] SORT_21 var_86_arg_2 = var_65; [L275] SORT_21 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_86=0, var_89=0] [L276] EXPR var_86 & mask_SORT_21 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_44=0, var_45=31, var_49=2, var_66=3, var_89=0] [L276] var_86 = var_86 & mask_SORT_21 [L277] SORT_21 var_87_arg_0 = var_86; [L278] SORT_21 var_87_arg_1 = var_49; [L279] SORT_3 var_87 = var_87_arg_0 == var_87_arg_1; [L280] SORT_3 var_88_arg_0 = var_87; [L281] SORT_3 var_88 = ~var_88_arg_0; [L282] SORT_43 var_103_arg_0 = var_44; [L283] SORT_43 var_103_arg_1 = var_45; [L284] SORT_3 var_103 = var_103_arg_0 == var_103_arg_1; [L285] SORT_21 var_100_arg_0 = var_86; [L286] SORT_21 var_100_arg_1 = var_23; [L287] SORT_3 var_100 = var_100_arg_0 == var_100_arg_1; [L288] SORT_21 var_98_arg_0 = var_86; [L289] SORT_21 var_98_arg_1 = var_22; [L290] SORT_3 var_98 = var_98_arg_0 == var_98_arg_1; [L291] SORT_3 var_101_arg_0 = var_100; [L292] SORT_3 var_101_arg_1 = var_98; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_101_arg_0=0, var_101_arg_1=1, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L293] EXPR var_101_arg_0 | var_101_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L293] SORT_3 var_101 = var_101_arg_0 | var_101_arg_1; [L294] EXPR var_101 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_103=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_86=0, var_88=-1, var_89=0, var_98=1] [L294] var_101 = var_101 & mask_SORT_3 [L295] SORT_3 var_99_arg_0 = var_98; [L296] SORT_6 var_99_arg_1 = var_89; [L297] SORT_6 var_99_arg_2 = state_96; [L298] SORT_6 var_99 = var_99_arg_0 ? var_99_arg_1 : var_99_arg_2; [L299] SORT_21 var_94_arg_0 = var_86; [L300] SORT_21 var_94_arg_1 = var_49; [L301] SORT_3 var_94 = var_94_arg_0 == var_94_arg_1; [L302] SORT_3 var_95_arg_0 = var_94; [L303] SORT_6 var_95_arg_1 = state_92; [L304] SORT_6 var_95_arg_2 = state_90; [L305] SORT_6 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L306] SORT_3 var_102_arg_0 = var_101; [L307] SORT_6 var_102_arg_1 = var_99; [L308] SORT_6 var_102_arg_2 = var_95; [L309] SORT_6 var_102 = var_102_arg_0 ? var_102_arg_1 : var_102_arg_2; [L310] SORT_3 var_104_arg_0 = var_103; [L311] SORT_6 var_104_arg_1 = var_89; [L312] SORT_6 var_104_arg_2 = var_102; [L313] SORT_6 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L314] SORT_6 var_105_arg_0 = var_104; [L315] SORT_1 var_105 = var_105_arg_0 >> 26; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_105=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L316] EXPR var_105 & mask_SORT_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L316] var_105 = var_105 & mask_SORT_1 [L317] SORT_6 var_106_arg_0 = state_90; [L318] SORT_1 var_106 = var_106_arg_0 >> 26; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_105=0, var_106=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L319] EXPR var_106 & mask_SORT_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_105=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_88=-1, var_89=0] [L319] var_106 = var_106 & mask_SORT_1 [L320] SORT_1 var_107_arg_0 = var_105; [L321] SORT_1 var_107_arg_1 = var_106; [L322] SORT_3 var_107 = var_107_arg_0 == var_107_arg_1; [L323] SORT_3 var_108_arg_0 = var_88; [L324] SORT_3 var_108_arg_1 = var_107; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_108_arg_0=-1, var_108_arg_1=1, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L325] EXPR var_108_arg_0 | var_108_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L325] SORT_3 var_108 = var_108_arg_0 | var_108_arg_1; [L326] SORT_3 var_109_arg_0 = var_108; [L327] SORT_3 var_109 = ~var_109_arg_0; [L328] SORT_3 var_112_arg_0 = var_109; [L329] SORT_3 var_112 = ~var_112_arg_0; [L330] SORT_3 var_113_arg_0 = var_28; [L331] SORT_3 var_113_arg_1 = var_112; VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_113_arg_0=1, var_113_arg_1=-1, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L332] EXPR var_113_arg_0 & var_113_arg_1 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L332] SORT_3 var_113 = var_113_arg_0 & var_113_arg_1; [L333] EXPR var_113 & mask_SORT_3 VAL [input_10=0, input_11=0, input_14=0, input_16=0, input_17=0, input_18=0, input_19=0, input_4=0, input_5=0, input_8=0, mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_30=0, state_39=0, state_51=0, state_55=0, state_72=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L333] var_113 = var_113 & mask_SORT_3 [L334] SORT_3 bad_114_arg_0 = var_113; [L335] CALL __VERIFIER_assert(!(bad_114_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 242 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1518 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1518 mSDsluCounter, 13319 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10446 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 765 IncrementalHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 2873 mSDtfsCounter, 765 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=8, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1029 NumberOfCodeBlocks, 1029 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 3003 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:48:19,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.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 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:48:20,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:48:20,940 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:48:20,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:48:20,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:48:20,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:48:20,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:48:20,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:48:20,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:48:20,971 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:48:20,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:48:20,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:48:20,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:48:20,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:48:20,972 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:48:20,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:48:20,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:48:20,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:48:20,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:48:20,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:48:20,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:48:20,972 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:48:20,972 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:48:20,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:48:20,973 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:48:20,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:48:20,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:48:20,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:48:20,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:48:20,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:48:20,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:48:20,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:48:20,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:48:20,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:48:20,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:48:20,974 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:48:20,975 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:48:20,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:48:20,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:48:20,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:48:20,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:48:20,975 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 -> 45bfa32c6b634390125a13abc4f6844d47a46f27aa4ffd4fb1f61e72ec5b5312 [2024-11-07 03:48:21,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:48:21,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:48:21,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:48:21,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:48:21,218 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:48:21,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-11-07 03:48:22,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:48:22,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:48:22,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-11-07 03:48:22,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74951132e/d132a454f43042adb6f372b92eeda152/FLAG8247ff593 [2024-11-07 03:48:22,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74951132e/d132a454f43042adb6f372b92eeda152 [2024-11-07 03:48:22,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:48:22,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:48:22,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:48:22,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:48:22,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:48:22,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:48:22" (1/1) ... [2024-11-07 03:48:22,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14aee93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:22, skipping insertion in model container [2024-11-07 03:48:22,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:48:22" (1/1) ... [2024-11-07 03:48:22,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:48:22,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c[1258,1271] [2024-11-07 03:48:22,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:48:22,822 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:48:22,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_fru32_p3.c[1258,1271] [2024-11-07 03:48:22,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:48:22,881 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:48:22,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:22 WrapperNode [2024-11-07 03:48:22,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:48:22,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:48:22,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:48:22,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:48:22,887 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:48:22" (1/1) ... [2024-11-07 03:48:22,899 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:48:22" (1/1) ... [2024-11-07 03:48:22,928 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 468 [2024-11-07 03:48:22,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:48:22,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:48:22,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:48:22,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:48:22,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:22" (1/1) ... [2024-11-07 03:48:22,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:22" (1/1) ... [2024-11-07 03:48:22,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:22" (1/1) ... [2024-11-07 03:48:22,949 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:48:22,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:22" (1/1) ... [2024-11-07 03:48:22,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:22" (1/1) ... [2024-11-07 03:48:22,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:22" (1/1) ... [2024-11-07 03:48:22,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:22" (1/1) ... [2024-11-07 03:48:22,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:22" (1/1) ... [2024-11-07 03:48:22,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:22" (1/1) ... [2024-11-07 03:48:22,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:48:22,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:48:22,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:48:22,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:48:22,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:22" (1/1) ... [2024-11-07 03:48:22,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:48:22,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:48:22,993 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:48:22,996 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:48:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:48:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:48:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:48:23,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:48:23,140 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:48:23,142 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:48:23,493 INFO L? ?]: Removed 207 outVars from TransFormulas that were not future-live. [2024-11-07 03:48:23,496 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:48:23,501 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:48:23,502 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:48:23,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:48:23 BoogieIcfgContainer [2024-11-07 03:48:23,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:48:23,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:48:23,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:48:23,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:48:23,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:48:22" (1/3) ... [2024-11-07 03:48:23,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea2ad2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:48:23, skipping insertion in model container [2024-11-07 03:48:23,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:22" (2/3) ... [2024-11-07 03:48:23,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea2ad2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:48:23, skipping insertion in model container [2024-11-07 03:48:23,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:48:23" (3/3) ... [2024-11-07 03:48:23,511 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_fru32_p3.c [2024-11-07 03:48:23,521 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:48:23,521 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:48:23,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:48:23,569 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;@399de776, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:48:23,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:48:23,571 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:48:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 03:48:23,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:48:23,575 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 03:48:23,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:48:23,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:48:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 03:48:23,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:48:23,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93674205] [2024-11-07 03:48:23,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:48:23,589 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:48:23,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:48:23,593 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:48:23,595 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:48:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:48:23,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:48:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:48:23,982 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 03:48:23,983 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:48:23,984 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:48:23,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 03:48:24,189 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:48:24,192 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-07 03:48:24,214 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:48:24,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:48:24 BoogieIcfgContainer [2024-11-07 03:48:24,216 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:48:24,217 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:48:24,217 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:48:24,217 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:48:24,218 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:48:23" (3/4) ... [2024-11-07 03:48:24,218 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 03:48:24,266 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 03:48:24,266 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:48:24,267 INFO L158 Benchmark]: Toolchain (without parser) took 1677.08ms. Allocated memory is still 83.9MB. Free memory was 60.3MB in the beginning and 52.0MB in the end (delta: 8.3MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-11-07 03:48:24,267 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:48:24,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.43ms. Allocated memory is still 83.9MB. Free memory was 60.3MB in the beginning and 40.6MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:48:24,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.49ms. Allocated memory is still 83.9MB. Free memory was 40.6MB in the beginning and 37.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:48:24,267 INFO L158 Benchmark]: Boogie Preprocessor took 40.70ms. Allocated memory is still 83.9MB. Free memory was 37.2MB in the beginning and 33.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:48:24,267 INFO L158 Benchmark]: RCFGBuilder took 532.25ms. Allocated memory is still 83.9MB. Free memory was 33.2MB in the beginning and 28.2MB in the end (delta: 5.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-07 03:48:24,267 INFO L158 Benchmark]: TraceAbstraction took 712.54ms. Allocated memory is still 83.9MB. Free memory was 27.6MB in the beginning and 23.5MB in the end (delta: 4.2MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-11-07 03:48:24,268 INFO L158 Benchmark]: Witness Printer took 49.04ms. Allocated memory is still 83.9MB. Free memory was 23.5MB in the beginning and 52.0MB in the end (delta: -28.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:48:24,269 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.17ms. Allocated memory is still 83.9MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.43ms. Allocated memory is still 83.9MB. Free memory was 60.3MB in the beginning and 40.6MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.49ms. Allocated memory is still 83.9MB. Free memory was 40.6MB in the beginning and 37.2MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.70ms. Allocated memory is still 83.9MB. Free memory was 37.2MB in the beginning and 33.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 532.25ms. Allocated memory is still 83.9MB. Free memory was 33.2MB in the beginning and 28.2MB in the end (delta: 5.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 712.54ms. Allocated memory is still 83.9MB. Free memory was 27.6MB in the beginning and 23.5MB in the end (delta: 4.2MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * Witness Printer took 49.04ms. Allocated memory is still 83.9MB. Free memory was 23.5MB in the beginning and 52.0MB in the end (delta: -28.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 6); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (6 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L35] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 2); [L36] const SORT_21 msb_SORT_21 = (SORT_21)1 << (2 - 1); [L38] const SORT_43 mask_SORT_43 = (SORT_43)-1 >> (sizeof(SORT_43) * 8 - 5); [L39] const SORT_43 msb_SORT_43 = (SORT_43)1 << (5 - 1); [L41] const SORT_21 var_22 = 0; [L42] const SORT_21 var_23 = 1; [L43] const SORT_1 var_24 = 0; [L44] const SORT_3 var_28 = 1; [L45] const SORT_3 var_34 = 0; [L46] const SORT_43 var_45 = 31; [L47] const SORT_21 var_49 = 2; [L48] const SORT_21 var_66 = 3; [L49] const SORT_6 var_89 = 0; [L51] SORT_1 input_2; [L52] SORT_3 input_4; [L53] SORT_1 input_5; [L54] SORT_6 input_7; [L55] SORT_3 input_8; [L56] SORT_6 input_9; [L57] SORT_1 input_10; [L58] SORT_1 input_11; [L59] SORT_1 input_12; [L60] SORT_3 input_13; [L61] SORT_3 input_14; [L62] SORT_3 input_15; [L63] SORT_3 input_16; [L64] SORT_3 input_17; [L65] SORT_3 input_18; [L66] SORT_3 input_19; [L67] SORT_3 input_20; [L68] SORT_3 input_119; [L69] SORT_3 input_123; [L70] SORT_1 input_125; [L71] SORT_3 input_127; [L72] SORT_21 input_130; [L73] SORT_3 input_132; [L74] SORT_6 input_135; [L75] SORT_3 input_137; [L77] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L80] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] SORT_3 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L83] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L84] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] SORT_3 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] SORT_3 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] SORT_3 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] SORT_6 state_90 = __VERIFIER_nondet_uint() & mask_SORT_6; [L89] SORT_6 state_92 = __VERIFIER_nondet_uint() & mask_SORT_6; [L90] SORT_6 state_96 = __VERIFIER_nondet_uint() & mask_SORT_6; [L91] SORT_1 state_115 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] SORT_3 state_117 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] SORT_1 init_26_arg_1 = var_24; [L96] state_25 = init_26_arg_1 [L97] SORT_1 init_31_arg_1 = var_24; [L98] state_30 = init_31_arg_1 [L99] SORT_3 init_36_arg_1 = var_34; [L100] state_35 = init_36_arg_1 [L101] SORT_3 init_40_arg_1 = var_34; [L102] state_39 = init_40_arg_1 [L103] SORT_1 init_52_arg_1 = var_24; [L104] state_51 = init_52_arg_1 [L105] SORT_3 init_56_arg_1 = var_34; [L106] state_55 = init_56_arg_1 [L107] SORT_3 init_60_arg_1 = var_34; [L108] state_59 = init_60_arg_1 [L109] SORT_1 init_69_arg_1 = var_24; [L110] state_68 = init_69_arg_1 [L111] SORT_3 init_73_arg_1 = var_34; [L112] state_72 = init_73_arg_1 [L113] SORT_3 init_77_arg_1 = var_34; [L114] state_76 = init_77_arg_1 [L115] SORT_3 init_81_arg_1 = var_34; [L116] state_80 = init_81_arg_1 [L117] SORT_6 init_91_arg_1 = var_89; [L118] state_90 = init_91_arg_1 [L119] SORT_6 init_93_arg_1 = var_89; [L120] state_92 = init_93_arg_1 [L121] SORT_6 init_97_arg_1 = var_89; [L122] state_96 = init_97_arg_1 [L123] SORT_1 init_116_arg_1 = var_24; [L124] state_115 = init_116_arg_1 [L125] SORT_3 init_118_arg_1 = var_34; [L126] state_117 = init_118_arg_1 [L127] SORT_3 init_122_arg_1 = var_34; [L128] state_121 = init_122_arg_1 VAL [mask_SORT_1=63, mask_SORT_21=3, mask_SORT_3=1, mask_SORT_43=31, state_115=0, state_117=0, state_121=0, state_25=0, state_30=0, state_35=0, state_39=0, state_51=0, state_55=0, state_59=0, state_68=0, state_72=0, state_76=0, state_80=0, state_90=0, state_92=0, state_96=0, var_22=0, var_23=1, var_28=1, var_45=31, var_49=2, var_66=3, var_89=0] [L131] input_2 = __VERIFIER_nondet_uchar() [L132] input_4 = __VERIFIER_nondet_uchar() [L133] input_4 = input_4 & mask_SORT_3 [L134] input_5 = __VERIFIER_nondet_uchar() [L135] input_5 = input_5 & mask_SORT_1 [L136] input_7 = __VERIFIER_nondet_uint() [L137] input_8 = __VERIFIER_nondet_uchar() [L138] input_8 = input_8 & mask_SORT_3 [L139] input_9 = __VERIFIER_nondet_uint() [L140] input_10 = __VERIFIER_nondet_uchar() [L141] input_10 = input_10 & mask_SORT_1 [L142] input_11 = __VERIFIER_nondet_uchar() [L143] input_11 = input_11 & mask_SORT_1 [L144] input_12 = __VERIFIER_nondet_uchar() [L145] input_13 = __VERIFIER_nondet_uchar() [L146] input_14 = __VERIFIER_nondet_uchar() [L147] input_14 = input_14 & mask_SORT_3 [L148] input_15 = __VERIFIER_nondet_uchar() [L149] input_16 = __VERIFIER_nondet_uchar() [L150] input_16 = input_16 & mask_SORT_3 [L151] input_17 = __VERIFIER_nondet_uchar() [L152] input_17 = input_17 & mask_SORT_3 [L153] input_18 = __VERIFIER_nondet_uchar() [L154] input_18 = input_18 & mask_SORT_3 [L155] input_19 = __VERIFIER_nondet_uchar() [L156] input_19 = input_19 & mask_SORT_3 [L157] input_20 = __VERIFIER_nondet_uchar() [L158] input_119 = __VERIFIER_nondet_uchar() [L159] input_123 = __VERIFIER_nondet_uchar() [L160] input_125 = __VERIFIER_nondet_uchar() [L161] input_127 = __VERIFIER_nondet_uchar() [L162] input_130 = __VERIFIER_nondet_uchar() [L163] input_132 = __VERIFIER_nondet_uchar() [L164] input_135 = __VERIFIER_nondet_uint() [L165] input_137 = __VERIFIER_nondet_uchar() [L168] SORT_1 var_27_arg_0 = state_25; [L169] SORT_3 var_27 = var_27_arg_0 >> 5; [L170] var_27 = var_27 & mask_SORT_3 [L171] SORT_3 var_67_arg_0 = var_27; [L172] SORT_3 var_67_arg_1 = var_28; [L173] SORT_3 var_67 = var_67_arg_0 == var_67_arg_1; [L174] SORT_1 var_70_arg_0 = state_25; [L175] SORT_1 var_70_arg_1 = state_68; [L176] SORT_3 var_70 = var_70_arg_0 == var_70_arg_1; [L177] SORT_3 var_71_arg_0 = var_67; [L178] SORT_3 var_71_arg_1 = var_70; [L179] SORT_3 var_71 = var_71_arg_0 & var_71_arg_1; [L180] SORT_3 var_74_arg_0 = state_72; [L181] SORT_3 var_74_arg_1 = var_28; [L182] SORT_3 var_74 = var_74_arg_0 != var_74_arg_1; [L183] SORT_3 var_75_arg_0 = var_71; [L184] SORT_3 var_75_arg_1 = var_74; [L185] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L186] SORT_3 var_78_arg_0 = state_76; [L187] SORT_3 var_78_arg_1 = var_28; [L188] SORT_3 var_78 = var_78_arg_0 == var_78_arg_1; [L189] SORT_3 var_79_arg_0 = var_75; [L190] SORT_3 var_79_arg_1 = var_78; [L191] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L192] SORT_3 var_82_arg_0 = state_80; [L193] SORT_3 var_82_arg_1 = var_28; [L194] SORT_3 var_82 = var_82_arg_0 == var_82_arg_1; [L195] SORT_3 var_83_arg_0 = var_79; [L196] SORT_3 var_83_arg_1 = var_82; [L197] SORT_3 var_83 = var_83_arg_0 & var_83_arg_1; [L198] SORT_1 var_44_arg_0 = state_25; [L199] SORT_43 var_44 = var_44_arg_0 >> 0; [L200] var_44 = var_44 & mask_SORT_43 [L201] SORT_43 var_84_arg_0 = var_44; [L202] SORT_43 var_84_arg_1 = var_45; [L203] SORT_3 var_84 = var_84_arg_0 != var_84_arg_1; [L204] SORT_3 var_85_arg_0 = var_83; [L205] SORT_3 var_85_arg_1 = var_84; [L206] SORT_3 var_85 = var_85_arg_0 & var_85_arg_1; [L207] var_85 = var_85 & mask_SORT_3 [L208] SORT_3 var_50_arg_0 = var_27; [L209] SORT_3 var_50_arg_1 = var_28; [L210] SORT_3 var_50 = var_50_arg_0 == var_50_arg_1; [L211] SORT_1 var_53_arg_0 = state_25; [L212] SORT_1 var_53_arg_1 = state_51; [L213] SORT_3 var_53 = var_53_arg_0 == var_53_arg_1; [L214] SORT_3 var_54_arg_0 = var_50; [L215] SORT_3 var_54_arg_1 = var_53; [L216] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L217] SORT_3 var_57_arg_0 = state_55; [L218] SORT_3 var_57_arg_1 = var_28; [L219] SORT_3 var_57 = var_57_arg_0 == var_57_arg_1; [L220] SORT_3 var_58_arg_0 = var_54; [L221] SORT_3 var_58_arg_1 = var_57; [L222] SORT_3 var_58 = var_58_arg_0 & var_58_arg_1; [L223] SORT_3 var_61_arg_0 = state_59; [L224] SORT_3 var_61_arg_1 = var_28; [L225] SORT_3 var_61 = var_61_arg_0 == var_61_arg_1; [L226] SORT_3 var_62_arg_0 = var_58; [L227] SORT_3 var_62_arg_1 = var_61; [L228] SORT_3 var_62 = var_62_arg_0 & var_62_arg_1; [L229] SORT_43 var_63_arg_0 = var_44; [L230] SORT_43 var_63_arg_1 = var_45; [L231] SORT_3 var_63 = var_63_arg_0 != var_63_arg_1; [L232] SORT_3 var_64_arg_0 = var_62; [L233] SORT_3 var_64_arg_1 = var_63; [L234] SORT_3 var_64 = var_64_arg_0 & var_64_arg_1; [L235] var_64 = var_64 & mask_SORT_3 [L236] SORT_3 var_29_arg_0 = var_27; [L237] SORT_3 var_29_arg_1 = var_28; [L238] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L239] SORT_1 var_32_arg_0 = state_25; [L240] SORT_1 var_32_arg_1 = state_30; [L241] SORT_3 var_32 = var_32_arg_0 == var_32_arg_1; [L242] SORT_3 var_33_arg_0 = var_29; [L243] SORT_3 var_33_arg_1 = var_32; [L244] SORT_3 var_33 = var_33_arg_0 & var_33_arg_1; [L245] SORT_3 var_37_arg_0 = state_35; [L246] SORT_3 var_37_arg_1 = var_28; [L247] SORT_3 var_37 = var_37_arg_0 == var_37_arg_1; [L248] SORT_3 var_38_arg_0 = var_33; [L249] SORT_3 var_38_arg_1 = var_37; [L250] SORT_3 var_38 = var_38_arg_0 & var_38_arg_1; [L251] SORT_3 var_41_arg_0 = state_39; [L252] SORT_3 var_41_arg_1 = var_28; [L253] SORT_3 var_41 = var_41_arg_0 == var_41_arg_1; [L254] SORT_3 var_42_arg_0 = var_38; [L255] SORT_3 var_42_arg_1 = var_41; [L256] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L257] SORT_43 var_46_arg_0 = var_44; [L258] SORT_43 var_46_arg_1 = var_45; [L259] SORT_3 var_46 = var_46_arg_0 != var_46_arg_1; [L260] SORT_3 var_47_arg_0 = var_42; [L261] SORT_3 var_47_arg_1 = var_46; [L262] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L263] var_47 = var_47 & mask_SORT_3 [L264] SORT_3 var_48_arg_0 = var_47; [L265] SORT_21 var_48_arg_1 = var_23; [L266] SORT_21 var_48_arg_2 = var_22; [L267] SORT_21 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L268] SORT_3 var_65_arg_0 = var_64; [L269] SORT_21 var_65_arg_1 = var_49; [L270] SORT_21 var_65_arg_2 = var_48; [L271] SORT_21 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L272] SORT_3 var_86_arg_0 = var_85; [L273] SORT_21 var_86_arg_1 = var_66; [L274] SORT_21 var_86_arg_2 = var_65; [L275] SORT_21 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L276] var_86 = var_86 & mask_SORT_21 [L277] SORT_21 var_87_arg_0 = var_86; [L278] SORT_21 var_87_arg_1 = var_49; [L279] SORT_3 var_87 = var_87_arg_0 == var_87_arg_1; [L280] SORT_3 var_88_arg_0 = var_87; [L281] SORT_3 var_88 = ~var_88_arg_0; [L282] SORT_43 var_103_arg_0 = var_44; [L283] SORT_43 var_103_arg_1 = var_45; [L284] SORT_3 var_103 = var_103_arg_0 == var_103_arg_1; [L285] SORT_21 var_100_arg_0 = var_86; [L286] SORT_21 var_100_arg_1 = var_23; [L287] SORT_3 var_100 = var_100_arg_0 == var_100_arg_1; [L288] SORT_21 var_98_arg_0 = var_86; [L289] SORT_21 var_98_arg_1 = var_22; [L290] SORT_3 var_98 = var_98_arg_0 == var_98_arg_1; [L291] SORT_3 var_101_arg_0 = var_100; [L292] SORT_3 var_101_arg_1 = var_98; [L293] SORT_3 var_101 = var_101_arg_0 | var_101_arg_1; [L294] var_101 = var_101 & mask_SORT_3 [L295] SORT_3 var_99_arg_0 = var_98; [L296] SORT_6 var_99_arg_1 = var_89; [L297] SORT_6 var_99_arg_2 = state_96; [L298] SORT_6 var_99 = var_99_arg_0 ? var_99_arg_1 : var_99_arg_2; [L299] SORT_21 var_94_arg_0 = var_86; [L300] SORT_21 var_94_arg_1 = var_49; [L301] SORT_3 var_94 = var_94_arg_0 == var_94_arg_1; [L302] SORT_3 var_95_arg_0 = var_94; [L303] SORT_6 var_95_arg_1 = state_92; [L304] SORT_6 var_95_arg_2 = state_90; [L305] SORT_6 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L306] SORT_3 var_102_arg_0 = var_101; [L307] SORT_6 var_102_arg_1 = var_99; [L308] SORT_6 var_102_arg_2 = var_95; [L309] SORT_6 var_102 = var_102_arg_0 ? var_102_arg_1 : var_102_arg_2; [L310] SORT_3 var_104_arg_0 = var_103; [L311] SORT_6 var_104_arg_1 = var_89; [L312] SORT_6 var_104_arg_2 = var_102; [L313] SORT_6 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L314] SORT_6 var_105_arg_0 = var_104; [L315] SORT_1 var_105 = var_105_arg_0 >> 26; [L316] var_105 = var_105 & mask_SORT_1 [L317] SORT_6 var_106_arg_0 = state_90; [L318] SORT_1 var_106 = var_106_arg_0 >> 26; [L319] var_106 = var_106 & mask_SORT_1 [L320] SORT_1 var_107_arg_0 = var_105; [L321] SORT_1 var_107_arg_1 = var_106; [L322] SORT_3 var_107 = var_107_arg_0 == var_107_arg_1; [L323] SORT_3 var_108_arg_0 = var_88; [L324] SORT_3 var_108_arg_1 = var_107; [L325] SORT_3 var_108 = var_108_arg_0 | var_108_arg_1; [L326] SORT_3 var_109_arg_0 = var_108; [L327] SORT_3 var_109 = ~var_109_arg_0; [L328] SORT_3 var_112_arg_0 = var_109; [L329] SORT_3 var_112 = ~var_112_arg_0; [L330] SORT_3 var_113_arg_0 = var_28; [L331] SORT_3 var_113_arg_1 = var_112; [L332] SORT_3 var_113 = var_113_arg_0 & var_113_arg_1; [L333] var_113 = var_113 & mask_SORT_3 [L334] SORT_3 bad_114_arg_0 = var_113; [L335] CALL __VERIFIER_assert(!(bad_114_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 proved your program to be incorrect! [2024-11-07 03:48:24,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE