/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 21:43:55,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 21:43:55,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 21:43:55,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 21:43:55,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 21:43:55,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 21:43:55,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 21:43:55,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 21:43:55,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 21:43:55,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 21:43:55,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 21:43:55,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 21:43:55,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 21:43:55,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 21:43:55,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 21:43:55,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 21:43:55,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 21:43:55,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 21:43:55,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 21:43:55,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 21:43:55,693 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 21:43:55,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 21:43:55,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 21:43:55,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 21:43:55,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 21:43:55,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 21:43:55,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 21:43:55,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 21:43:55,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 21:43:55,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 21:43:55,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 21:43:55,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 21:43:55,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 21:43:55,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 21:43:55,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 21:43:55,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 21:43:55,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 21:43:55,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 21:43:55,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 21:43:55,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 21:43:55,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 21:43:55,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 21:43:55,706 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 21:43:55,714 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 21:43:55,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 21:43:55,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 21:43:55,715 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 21:43:55,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 21:43:55,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 21:43:55,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 21:43:55,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 21:43:55,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 21:43:55,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 21:43:55,716 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 21:43:55,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 21:43:55,716 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 21:43:55,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 21:43:55,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 21:43:55,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 21:43:55,717 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 21:43:55,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 21:43:55,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:43:55,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 21:43:55,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 21:43:55,718 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 21:43:55,718 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 21:43:55,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 21:43:55,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 21:43:55,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 21:43:55,894 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 21:43:55,895 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 21:43:55,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound1.c [2022-04-14 21:43:55,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/223baa20c/e85fce539ee9487b8d03ecdde834784c/FLAG7f35417c6 [2022-04-14 21:43:56,251 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 21:43:56,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound1.c [2022-04-14 21:43:56,255 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/223baa20c/e85fce539ee9487b8d03ecdde834784c/FLAG7f35417c6 [2022-04-14 21:43:56,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/223baa20c/e85fce539ee9487b8d03ecdde834784c [2022-04-14 21:43:56,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 21:43:56,687 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 21:43:56,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 21:43:56,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 21:43:56,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 21:43:56,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:43:56" (1/1) ... [2022-04-14 21:43:56,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d3e63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:56, skipping insertion in model container [2022-04-14 21:43:56,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 09:43:56" (1/1) ... [2022-04-14 21:43:56,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 21:43:56,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 21:43:56,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound1.c[538,551] [2022-04-14 21:43:56,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:43:56,856 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 21:43:56,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound1.c[538,551] [2022-04-14 21:43:56,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 21:43:56,892 INFO L208 MainTranslator]: Completed translation [2022-04-14 21:43:56,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:56 WrapperNode [2022-04-14 21:43:56,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 21:43:56,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 21:43:56,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 21:43:56,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 21:43:56,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:56" (1/1) ... [2022-04-14 21:43:56,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:56" (1/1) ... [2022-04-14 21:43:56,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:56" (1/1) ... [2022-04-14 21:43:56,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:56" (1/1) ... [2022-04-14 21:43:56,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:56" (1/1) ... [2022-04-14 21:43:56,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:56" (1/1) ... [2022-04-14 21:43:56,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:56" (1/1) ... [2022-04-14 21:43:56,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 21:43:56,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 21:43:56,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 21:43:56,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 21:43:56,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:56" (1/1) ... [2022-04-14 21:43:56,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 21:43:56,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:43:56,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 21:43:56,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 21:43:56,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 21:43:56,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 21:43:57,000 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 21:43:57,000 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 21:43:57,000 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 21:43:57,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 21:43:57,000 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 21:43:57,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 21:43:57,000 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 21:43:57,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 21:43:57,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 21:43:57,000 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 21:43:57,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 21:43:57,001 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 21:43:57,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 21:43:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 21:43:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 21:43:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 21:43:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 21:43:57,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 21:43:57,049 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 21:43:57,050 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 21:43:57,211 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 21:43:57,215 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 21:43:57,216 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 21:43:57,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:43:57 BoogieIcfgContainer [2022-04-14 21:43:57,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 21:43:57,217 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 21:43:57,217 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 21:43:57,228 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 21:43:57,231 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:43:57" (1/1) ... [2022-04-14 21:43:57,232 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 21:43:57,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:43:57 BasicIcfg [2022-04-14 21:43:57,261 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 21:43:57,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 21:43:57,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 21:43:57,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 21:43:57,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 09:43:56" (1/4) ... [2022-04-14 21:43:57,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5c33d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:43:57, skipping insertion in model container [2022-04-14 21:43:57,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 09:43:56" (2/4) ... [2022-04-14 21:43:57,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5c33d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 09:43:57, skipping insertion in model container [2022-04-14 21:43:57,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 09:43:57" (3/4) ... [2022-04-14 21:43:57,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5c33d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 09:43:57, skipping insertion in model container [2022-04-14 21:43:57,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 09:43:57" (4/4) ... [2022-04-14 21:43:57,278 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound1.cJordan [2022-04-14 21:43:57,281 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 21:43:57,282 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 21:43:57,310 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 21:43:57,315 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-14 21:43:57,315 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 21:43:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 21:43:57,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 21:43:57,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:43:57,343 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:43:57,343 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:43:57,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:43:57,349 INFO L85 PathProgramCache]: Analyzing trace with hash 79654685, now seen corresponding path program 1 times [2022-04-14 21:43:57,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:43:57,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305787690] [2022-04-14 21:43:57,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:57,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:43:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:57,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 21:43:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:57,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {40#true} is VALID [2022-04-14 21:43:57,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-14 21:43:57,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-14 21:43:57,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 21:43:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:57,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-14 21:43:57,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} [110] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:43:57,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:43:57,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-14 21:43:57,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 21:43:57,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {40#true} is VALID [2022-04-14 21:43:57,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-14 21:43:57,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-14 21:43:57,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40#true} is VALID [2022-04-14 21:43:57,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {40#true} is VALID [2022-04-14 21:43:57,500 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {40#true} is VALID [2022-04-14 21:43:57,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {40#true} is VALID [2022-04-14 21:43:57,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} [110] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:43:57,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:43:57,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {41#false} is VALID [2022-04-14 21:43:57,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} [106] L28-1-->L35-3: Formula: (and (= v_main_~q~0_2 0) (= v_main_~r~0_2 (mod v_main_~A~0_4 4294967296)) (= v_main_~d~0_2 (mod v_main_~B~0_5 4294967296)) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {41#false} is VALID [2022-04-14 21:43:57,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} [108] L35-3-->L53-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:43:57,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} [112] L53-2-->L45-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:43:57,504 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod v_main_~A~0_10 4294967296) (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {41#false} is VALID [2022-04-14 21:43:57,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {41#false} is VALID [2022-04-14 21:43:57,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:43:57,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#false} is VALID [2022-04-14 21:43:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:43:57,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:43:57,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305787690] [2022-04-14 21:43:57,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305787690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:43:57,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:43:57,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 21:43:57,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587441015] [2022-04-14 21:43:57,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:43:57,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 21:43:57,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:43:57,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:43:57,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:57,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 21:43:57,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:43:57,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 21:43:57,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 21:43:57,546 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:43:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:57,722 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-14 21:43:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 21:43:57,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 21:43:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:43:57,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:43:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-14 21:43:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:43:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-04-14 21:43:57,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-04-14 21:43:57,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:57,796 INFO L225 Difference]: With dead ends: 38 [2022-04-14 21:43:57,797 INFO L226 Difference]: Without dead ends: 33 [2022-04-14 21:43:57,798 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 21:43:57,804 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:43:57,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:43:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-14 21:43:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-14 21:43:57,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:43:57,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:57,829 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:57,830 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:57,866 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-14 21:43:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-14 21:43:57,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:57,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:57,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-14 21:43:57,868 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-14 21:43:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:57,871 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-14 21:43:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-14 21:43:57,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:57,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:57,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:43:57,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:43:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-14 21:43:57,884 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-14 21:43:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:43:57,884 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-14 21:43:57,885 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:43:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-14 21:43:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 21:43:57,885 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:43:57,885 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:43:57,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 21:43:57,886 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:43:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:43:57,886 INFO L85 PathProgramCache]: Analyzing trace with hash -85369733, now seen corresponding path program 1 times [2022-04-14 21:43:57,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:43:57,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466261216] [2022-04-14 21:43:57,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:43:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:57,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 21:43:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:58,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {200#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {188#true} is VALID [2022-04-14 21:43:58,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:43:58,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {188#true} {188#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:43:58,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 21:43:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:58,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {188#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {188#true} is VALID [2022-04-14 21:43:58,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:43:58,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {188#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:43:58,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {188#true} {188#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {188#true} is VALID [2022-04-14 21:43:58,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {188#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {200#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 21:43:58,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {200#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {188#true} is VALID [2022-04-14 21:43:58,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {188#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:43:58,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {188#true} {188#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:43:58,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {188#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:43:58,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {188#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {188#true} is VALID [2022-04-14 21:43:58,023 INFO L272 TraceCheckUtils]: 6: Hoare triple {188#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {188#true} is VALID [2022-04-14 21:43:58,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {188#true} is VALID [2022-04-14 21:43:58,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {188#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:43:58,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {188#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#true} is VALID [2022-04-14 21:43:58,024 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {188#true} {188#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {188#true} is VALID [2022-04-14 21:43:58,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {188#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~q~0_2 0) (= v_main_~r~0_2 (mod v_main_~A~0_4 4294967296)) (= v_main_~d~0_2 (mod v_main_~B~0_5 4294967296)) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {197#(= main_~q~0 0)} is VALID [2022-04-14 21:43:58,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {197#(= main_~q~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {197#(= main_~q~0 0)} is VALID [2022-04-14 21:43:58,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {197#(= main_~q~0 0)} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {197#(= main_~q~0 0)} is VALID [2022-04-14 21:43:58,027 INFO L272 TraceCheckUtils]: 14: Hoare triple {197#(= main_~q~0 0)} [120] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {198#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 21:43:58,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {199#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 21:43:58,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {199#(not (= __VERIFIER_assert_~cond 0))} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {189#false} is VALID [2022-04-14 21:43:58,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {189#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {189#false} is VALID [2022-04-14 21:43:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:43:58,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:43:58,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466261216] [2022-04-14 21:43:58,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466261216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:43:58,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:43:58,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 21:43:58,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031449941] [2022-04-14 21:43:58,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:43:58,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 21:43:58,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:43:58,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:43:58,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:58,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 21:43:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:43:58,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 21:43:58,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 21:43:58,051 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:43:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:58,361 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-14 21:43:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 21:43:58,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 21:43:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:43:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:43:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-14 21:43:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:43:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-14 21:43:58,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2022-04-14 21:43:58,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:58,422 INFO L225 Difference]: With dead ends: 45 [2022-04-14 21:43:58,422 INFO L226 Difference]: Without dead ends: 45 [2022-04-14 21:43:58,422 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-14 21:43:58,423 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 21:43:58,423 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 21:43:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-14 21:43:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-14 21:43:58,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:43:58,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:58,427 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:58,427 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:58,429 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-14 21:43:58,429 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-14 21:43:58,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:58,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:58,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-14 21:43:58,430 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-14 21:43:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:58,433 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-14 21:43:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-14 21:43:58,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:58,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:58,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:43:58,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:43:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-14 21:43:58,435 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-14 21:43:58,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:43:58,435 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-14 21:43:58,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 21:43:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-14 21:43:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 21:43:58,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:43:58,436 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:43:58,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 21:43:58,436 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:43:58,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:43:58,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1527809342, now seen corresponding path program 1 times [2022-04-14 21:43:58,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:43:58,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184473409] [2022-04-14 21:43:58,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:58,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:43:58,449 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:43:58,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1631314250] [2022-04-14 21:43:58,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:58,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:43:58,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:43:58,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:43:58,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 21:43:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:58,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 21:43:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:58,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:43:58,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {382#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {382#true} is VALID [2022-04-14 21:43:58,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:58,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#(<= ~counter~0 0)} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:58,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {390#(<= ~counter~0 0)} {382#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:58,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {390#(<= ~counter~0 0)} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:58,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {390#(<= ~counter~0 0)} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:58,666 INFO L272 TraceCheckUtils]: 6: Hoare triple {390#(<= ~counter~0 0)} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:58,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(<= ~counter~0 0)} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:58,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#(<= ~counter~0 0)} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:58,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {390#(<= ~counter~0 0)} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:58,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {390#(<= ~counter~0 0)} {390#(<= ~counter~0 0)} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:58,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {390#(<= ~counter~0 0)} [106] L28-1-->L35-3: Formula: (and (= v_main_~q~0_2 0) (= v_main_~r~0_2 (mod v_main_~A~0_4 4294967296)) (= v_main_~d~0_2 (mod v_main_~B~0_5 4294967296)) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {390#(<= ~counter~0 0)} is VALID [2022-04-14 21:43:58,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {390#(<= ~counter~0 0)} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {424#(<= |main_#t~post6| 0)} is VALID [2022-04-14 21:43:58,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {424#(<= |main_#t~post6| 0)} [114] L35-1-->L53-2: Formula: (not (< |v_main_#t~post6_3| 1)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {383#false} is VALID [2022-04-14 21:43:58,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {383#false} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {383#false} is VALID [2022-04-14 21:43:58,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {383#false} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 1)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {383#false} is VALID [2022-04-14 21:43:58,670 INFO L272 TraceCheckUtils]: 16: Hoare triple {383#false} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod v_main_~A~0_10 4294967296) (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {383#false} is VALID [2022-04-14 21:43:58,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {383#false} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {383#false} is VALID [2022-04-14 21:43:58,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {383#false} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {383#false} is VALID [2022-04-14 21:43:58,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {383#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {383#false} is VALID [2022-04-14 21:43:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:43:58,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:43:58,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:43:58,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184473409] [2022-04-14 21:43:58,671 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:43:58,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631314250] [2022-04-14 21:43:58,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631314250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:43:58,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:43:58,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 21:43:58,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249683325] [2022-04-14 21:43:58,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:43:58,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-14 21:43:58,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:43:58,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:43:58,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:58,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 21:43:58,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:43:58,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 21:43:58,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 21:43:58,692 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:43:58,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:58,765 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-14 21:43:58,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 21:43:58,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-14 21:43:58,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:43:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:43:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-14 21:43:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:43:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-14 21:43:58,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-04-14 21:43:58,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:58,805 INFO L225 Difference]: With dead ends: 38 [2022-04-14 21:43:58,805 INFO L226 Difference]: Without dead ends: 38 [2022-04-14 21:43:58,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 21:43:58,808 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:43:58,809 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:43:58,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-14 21:43:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-14 21:43:58,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:43:58,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:58,817 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:58,818 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:58,822 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-14 21:43:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-14 21:43:58,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:58,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:58,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-14 21:43:58,826 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-14 21:43:58,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:58,829 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-14 21:43:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-14 21:43:58,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:58,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:58,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:43:58,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:43:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:58,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-14 21:43:58,838 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-14 21:43:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:43:58,838 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-14 21:43:58,838 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 21:43:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-14 21:43:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 21:43:58,839 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:43:58,839 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:43:58,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 21:43:59,062 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:43:59,062 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:43:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:43:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2128444854, now seen corresponding path program 1 times [2022-04-14 21:43:59,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:43:59,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972716667] [2022-04-14 21:43:59,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:59,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:43:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:59,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 21:43:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:59,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {613#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {597#true} is VALID [2022-04-14 21:43:59,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:43:59,130 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {597#true} {597#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:43:59,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 21:43:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:59,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {597#true} is VALID [2022-04-14 21:43:59,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:43:59,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:43:59,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {597#true} is VALID [2022-04-14 21:43:59,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-14 21:43:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:59,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {597#true} is VALID [2022-04-14 21:43:59,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:43:59,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:43:59,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {606#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {606#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-14 21:43:59,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {597#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {613#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 21:43:59,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {597#true} is VALID [2022-04-14 21:43:59,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:43:59,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:43:59,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {597#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:43:59,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {597#true} is VALID [2022-04-14 21:43:59,142 INFO L272 TraceCheckUtils]: 6: Hoare triple {597#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {597#true} is VALID [2022-04-14 21:43:59,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {597#true} is VALID [2022-04-14 21:43:59,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {597#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:43:59,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:43:59,143 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {597#true} {597#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {597#true} is VALID [2022-04-14 21:43:59,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {597#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~q~0_2 0) (= v_main_~r~0_2 (mod v_main_~A~0_4 4294967296)) (= v_main_~d~0_2 (mod v_main_~B~0_5 4294967296)) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {606#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-14 21:43:59,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {606#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {606#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-14 21:43:59,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {606#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {606#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-14 21:43:59,145 INFO L272 TraceCheckUtils]: 14: Hoare triple {606#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {597#true} is VALID [2022-04-14 21:43:59,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {597#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {597#true} is VALID [2022-04-14 21:43:59,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {597#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:43:59,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {597#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#true} is VALID [2022-04-14 21:43:59,145 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {597#true} {606#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {606#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-14 21:43:59,146 INFO L272 TraceCheckUtils]: 19: Hoare triple {606#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 (mod v_main_~A~0_8 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {611#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 21:43:59,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {611#(not (= |__VERIFIER_assert_#in~cond| 0))} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {612#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 21:43:59,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {612#(not (= __VERIFIER_assert_~cond 0))} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {598#false} is VALID [2022-04-14 21:43:59,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {598#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {598#false} is VALID [2022-04-14 21:43:59,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 21:43:59,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:43:59,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972716667] [2022-04-14 21:43:59,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972716667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:43:59,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:43:59,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 21:43:59,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044888154] [2022-04-14 21:43:59,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:43:59,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-14 21:43:59,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:43:59,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:43:59,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:59,164 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 21:43:59,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:43:59,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 21:43:59,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 21:43:59,165 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:43:59,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:59,474 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-14 21:43:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 21:43:59,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-14 21:43:59,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:43:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:43:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-14 21:43:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:43:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-14 21:43:59,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2022-04-14 21:43:59,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:59,538 INFO L225 Difference]: With dead ends: 50 [2022-04-14 21:43:59,538 INFO L226 Difference]: Without dead ends: 50 [2022-04-14 21:43:59,538 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-14 21:43:59,539 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 21:43:59,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 21:43:59,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-14 21:43:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-14 21:43:59,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:43:59,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:59,542 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:59,542 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:59,544 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-14 21:43:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-14 21:43:59,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:59,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:59,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-14 21:43:59,545 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-14 21:43:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:59,546 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-14 21:43:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-14 21:43:59,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:59,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:59,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:43:59,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:43:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 21:43:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-14 21:43:59,548 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-14 21:43:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:43:59,548 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-14 21:43:59,549 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 21:43:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-14 21:43:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 21:43:59,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:43:59,549 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:43:59,549 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 21:43:59,549 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:43:59,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:43:59,550 INFO L85 PathProgramCache]: Analyzing trace with hash 135546551, now seen corresponding path program 1 times [2022-04-14 21:43:59,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:43:59,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915136539] [2022-04-14 21:43:59,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:59,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:43:59,561 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:43:59,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1488840394] [2022-04-14 21:43:59,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:43:59,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:43:59,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:43:59,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:43:59,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 21:43:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:59,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 21:43:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:43:59,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:43:59,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {816#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:43:59,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {816#true} is VALID [2022-04-14 21:43:59,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:43:59,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:43:59,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:43:59,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {816#true} is VALID [2022-04-14 21:43:59,724 INFO L272 TraceCheckUtils]: 6: Hoare triple {816#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {816#true} is VALID [2022-04-14 21:43:59,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {816#true} is VALID [2022-04-14 21:43:59,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {816#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:43:59,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {816#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:43:59,725 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {816#true} {816#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {816#true} is VALID [2022-04-14 21:43:59,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~q~0_2 0) (= v_main_~r~0_2 (mod v_main_~A~0_4 4294967296)) (= v_main_~d~0_2 (mod v_main_~B~0_5 4294967296)) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {854#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-14 21:43:59,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {854#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {854#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-14 21:43:59,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {854#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {854#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-14 21:43:59,727 INFO L272 TraceCheckUtils]: 14: Hoare triple {854#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {816#true} is VALID [2022-04-14 21:43:59,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {816#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {816#true} is VALID [2022-04-14 21:43:59,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {816#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:43:59,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {816#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:43:59,735 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {816#true} {854#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {854#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-14 21:43:59,735 INFO L272 TraceCheckUtils]: 19: Hoare triple {854#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 (mod v_main_~A~0_8 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {816#true} is VALID [2022-04-14 21:43:59,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {816#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {816#true} is VALID [2022-04-14 21:43:59,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {816#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:43:59,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {816#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {816#true} is VALID [2022-04-14 21:43:59,736 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {816#true} {854#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 (mod v_main_~A~0_8 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {854#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-14 21:43:59,737 INFO L272 TraceCheckUtils]: 24: Hoare triple {854#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~p~0_11 (mod v_main_~B~0_11 4294967296)) v_main_~d~0_14) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {894#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:43:59,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {894#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {898#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:43:59,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {898#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {817#false} is VALID [2022-04-14 21:43:59,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {817#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {817#false} is VALID [2022-04-14 21:43:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 21:43:59,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:43:59,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:43:59,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915136539] [2022-04-14 21:43:59,738 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:43:59,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488840394] [2022-04-14 21:43:59,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488840394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:43:59,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:43:59,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 21:43:59,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046932840] [2022-04-14 21:43:59,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:43:59,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-14 21:43:59,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:43:59,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 21:43:59,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:59,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 21:43:59,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:43:59,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 21:43:59,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 21:43:59,760 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 21:43:59,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:59,933 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-14 21:43:59,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 21:43:59,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-14 21:43:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:43:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 21:43:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-14 21:43:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 21:43:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-14 21:43:59,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-14 21:43:59,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:43:59,988 INFO L225 Difference]: With dead ends: 57 [2022-04-14 21:43:59,989 INFO L226 Difference]: Without dead ends: 56 [2022-04-14 21:43:59,989 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 21:43:59,989 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:43:59,989 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 143 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:43:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-14 21:43:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-14 21:43:59,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:43:59,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 21:43:59,993 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 21:43:59,993 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 21:43:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:59,996 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-14 21:43:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-14 21:43:59,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:59,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:59,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-14 21:43:59,996 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-14 21:43:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:43:59,998 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-14 21:43:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-14 21:43:59,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:43:59,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:43:59,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:43:59,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:43:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 21:44:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-14 21:44:00,000 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 28 [2022-04-14 21:44:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:44:00,001 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-14 21:44:00,001 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 21:44:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-14 21:44:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-14 21:44:00,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:44:00,001 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:44:00,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 21:44:00,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:44:00,207 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:44:00,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:44:00,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1016025214, now seen corresponding path program 1 times [2022-04-14 21:44:00,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:44:00,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023972521] [2022-04-14 21:44:00,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:44:00,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:44:00,218 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:44:00,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1611043590] [2022-04-14 21:44:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:44:00,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:44:00,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:44:00,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:44:00,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 21:44:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:44:00,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 21:44:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 21:44:00,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 21:44:00,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {1131#true} [99] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-14 21:44:00,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {1131#true} [101] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1131#true} is VALID [2022-04-14 21:44:00,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {1131#true} [104] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-14 21:44:00,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1131#true} {1131#true} [140] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-14 21:44:00,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {1131#true} [100] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-14 21:44:00,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {1131#true} [103] mainENTRY-->L28: Formula: (and (= v_main_~A~0_1 |v_main_#t~nondet4_2|) (= v_main_~B~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~d~0=v_main_~d~0_1, main_~B~0=v_main_~B~0_1, main_~A~0=v_main_~A~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~d~0, main_~B~0, main_~A~0, main_~p~0, main_~r~0] {1131#true} is VALID [2022-04-14 21:44:00,428 INFO L272 TraceCheckUtils]: 6: Hoare triple {1131#true} [105] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1131#true} is VALID [2022-04-14 21:44:00,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {1131#true} [107] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1131#true} is VALID [2022-04-14 21:44:00,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {1131#true} [111] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-14 21:44:00,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {1131#true} [116] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-14 21:44:00,429 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1131#true} {1131#true} [141] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~B~0_10 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~B~0=v_main_~B~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~B~0, assume_abort_if_not_#in~cond] {1131#true} is VALID [2022-04-14 21:44:00,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {1131#true} [106] L28-1-->L35-3: Formula: (and (= v_main_~q~0_2 0) (= v_main_~r~0_2 (mod v_main_~A~0_4 4294967296)) (= v_main_~d~0_2 (mod v_main_~B~0_5 4294967296)) (= v_main_~p~0_2 1)) InVars {main_~A~0=v_main_~A~0_4, main_~B~0=v_main_~B~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~d~0=v_main_~d~0_2, main_~B~0=v_main_~B~0_5, main_~A~0=v_main_~A~0_4, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~d~0, main_~p~0, main_~r~0] {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:44:00,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} [109] L35-3-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:44:00,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} [115] L35-1-->L36: Formula: (< |v_main_#t~post6_5| 1) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:44:00,430 INFO L272 TraceCheckUtils]: 14: Hoare triple {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} [120] L36-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1131#true} is VALID [2022-04-14 21:44:00,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {1131#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1131#true} is VALID [2022-04-14 21:44:00,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {1131#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-14 21:44:00,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {1131#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-14 21:44:00,431 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1131#true} {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} [143] __VERIFIER_assertEXIT-->L36-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~q~0_8 0) 1 0)) InVars {main_~q~0=v_main_~q~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond] {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:44:00,431 INFO L272 TraceCheckUtils]: 19: Hoare triple {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} [124] L36-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~r~0_11 (mod v_main_~A~0_8 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1131#true} is VALID [2022-04-14 21:44:00,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {1131#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1131#true} is VALID [2022-04-14 21:44:00,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {1131#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-14 21:44:00,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {1131#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-14 21:44:00,432 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1131#true} {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} [144] __VERIFIER_assertEXIT-->L37: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~r~0_11 (mod v_main_~A~0_8 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~A~0=v_main_~A~0_8, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~A~0, main_~r~0] {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:44:00,432 INFO L272 TraceCheckUtils]: 24: Hoare triple {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} [129] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~p~0_11 (mod v_main_~B~0_11 4294967296)) v_main_~d~0_14) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1131#true} is VALID [2022-04-14 21:44:00,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {1131#true} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1131#true} is VALID [2022-04-14 21:44:00,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {1131#true} [127] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-14 21:44:00,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {1131#true} [133] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1131#true} is VALID [2022-04-14 21:44:00,434 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1131#true} {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} [145] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (* v_main_~p~0_11 (mod v_main_~B~0_11 4294967296)) v_main_~d~0_14) 1 0)) InVars {main_~d~0=v_main_~d~0_14, main_~B~0=v_main_~B~0_11, main_~p~0=v_main_~p~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~d~0, main_~B~0, main_~p~0] {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:44:00,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} [136] L38-->L53-2: Formula: (not (<= v_main_~d~0_4 v_main_~r~0_4)) InVars {main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} OutVars{main_~d~0=v_main_~d~0_4, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[] {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:44:00,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} [113] L53-2-->L45: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:44:00,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} [118] L45-->L45-2: Formula: (not (< |v_main_#t~post7_3| 1)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 21:44:00,436 INFO L272 TraceCheckUtils]: 32: Hoare triple {1169#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} [117] L45-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_6| (ite (= (mod v_main_~A~0_10 4294967296) (+ (* v_main_~q~0_10 v_main_~d~0_16) v_main_~r~0_13)) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~d~0=v_main_~d~0_16, main_~A~0=v_main_~A~0_10, main_~r~0=v_main_~r~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~d~0, main_~A~0, main_~r~0] {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 21:44:00,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {1233#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 21:44:00,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {1237#(<= 1 __VERIFIER_assert_~cond)} [126] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1132#false} is VALID [2022-04-14 21:44:00,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {1132#false} [131] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1132#false} is VALID [2022-04-14 21:44:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 21:44:00,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 21:44:00,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 21:44:00,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023972521] [2022-04-14 21:44:00,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 21:44:00,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611043590] [2022-04-14 21:44:00,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611043590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 21:44:00,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 21:44:00,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 21:44:00,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990795998] [2022-04-14 21:44:00,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 21:44:00,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-14 21:44:00,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 21:44:00,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:44:00,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:44:00,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 21:44:00,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 21:44:00,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 21:44:00,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 21:44:00,461 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:44:00,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:44:00,626 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-04-14 21:44:00,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 21:44:00,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-14 21:44:00,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 21:44:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:44:00,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-14 21:44:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:44:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-14 21:44:00,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-14 21:44:00,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 21:44:00,682 INFO L225 Difference]: With dead ends: 68 [2022-04-14 21:44:00,682 INFO L226 Difference]: Without dead ends: 62 [2022-04-14 21:44:00,682 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 21:44:00,683 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 21:44:00,688 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 118 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 21:44:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-14 21:44:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-04-14 21:44:00,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 21:44:00,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 61 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 states have internal predecessors, (46), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 21:44:00,699 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 61 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 states have internal predecessors, (46), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 21:44:00,700 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 61 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 states have internal predecessors, (46), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 21:44:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:44:00,701 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2022-04-14 21:44:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2022-04-14 21:44:00,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:44:00,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:44:00,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 states have internal predecessors, (46), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 62 states. [2022-04-14 21:44:00,702 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 states have internal predecessors, (46), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 62 states. [2022-04-14 21:44:00,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 21:44:00,704 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2022-04-14 21:44:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2022-04-14 21:44:00,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 21:44:00,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 21:44:00,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 21:44:00,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 21:44:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 states have internal predecessors, (46), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 21:44:00,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2022-04-14 21:44:00,706 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 36 [2022-04-14 21:44:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 21:44:00,706 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2022-04-14 21:44:00,706 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 21:44:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-14 21:44:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 21:44:00,711 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 21:44:00,711 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:44:00,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 21:44:00,926 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:44:00,926 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 21:44:00,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 21:44:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash 66401941, now seen corresponding path program 1 times [2022-04-14 21:44:00,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 21:44:00,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049814925] [2022-04-14 21:44:00,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:44:00,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 21:44:00,946 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 21:44:00,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444019546] [2022-04-14 21:44:00,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 21:44:00,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:44:00,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 21:44:00,947 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 21:44:00,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 21:44:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 21:44:01,006 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 21:44:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 21:44:01,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 21:44:01,035 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 21:44:01,035 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 21:44:01,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-14 21:44:01,250 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 21:44:01,253 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-14 21:44:01,255 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 21:44:01,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 09:44:01 BasicIcfg [2022-04-14 21:44:01,277 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 21:44:01,278 INFO L158 Benchmark]: Toolchain (without parser) took 4590.25ms. Allocated memory was 175.1MB in the beginning and 215.0MB in the end (delta: 39.8MB). Free memory was 126.3MB in the beginning and 85.6MB in the end (delta: 40.7MB). Peak memory consumption was 81.4MB. Max. memory is 8.0GB. [2022-04-14 21:44:01,278 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 175.1MB. Free memory was 142.4MB in the beginning and 142.3MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 21:44:01,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.30ms. Allocated memory is still 175.1MB. Free memory was 126.1MB in the beginning and 150.3MB in the end (delta: -24.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 21:44:01,278 INFO L158 Benchmark]: Boogie Preprocessor took 39.21ms. Allocated memory is still 175.1MB. Free memory was 150.3MB in the beginning and 148.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 21:44:01,278 INFO L158 Benchmark]: RCFGBuilder took 283.95ms. Allocated memory is still 175.1MB. Free memory was 148.8MB in the beginning and 137.1MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 21:44:01,278 INFO L158 Benchmark]: IcfgTransformer took 43.42ms. Allocated memory is still 175.1MB. Free memory was 137.1MB in the beginning and 135.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 21:44:01,279 INFO L158 Benchmark]: TraceAbstraction took 4015.10ms. Allocated memory was 175.1MB in the beginning and 215.0MB in the end (delta: 39.8MB). Free memory was 134.6MB in the beginning and 85.6MB in the end (delta: 49.0MB). Peak memory consumption was 89.3MB. Max. memory is 8.0GB. [2022-04-14 21:44:01,279 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 175.1MB. Free memory was 142.4MB in the beginning and 142.3MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.30ms. Allocated memory is still 175.1MB. Free memory was 126.1MB in the beginning and 150.3MB in the end (delta: -24.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.21ms. Allocated memory is still 175.1MB. Free memory was 150.3MB in the beginning and 148.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 283.95ms. Allocated memory is still 175.1MB. Free memory was 148.8MB in the beginning and 137.1MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 43.42ms. Allocated memory is still 175.1MB. Free memory was 137.1MB in the beginning and 135.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4015.10ms. Allocated memory was 175.1MB in the beginning and 215.0MB in the end (delta: 39.8MB). Free memory was 134.6MB in the beginning and 85.6MB in the end (delta: 49.0MB). Peak memory consumption was 89.3MB. Max. memory is 8.0GB. * 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: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=4, counter=0] [L24] unsigned int A, B; [L25] long long r, d, p, q; [L26] A = __VERIFIER_nondet_uint() [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L12] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L28] RET assume_abort_if_not(B >= 1) VAL [\old(counter)=0, A=8589934591, B=4294967295, counter=0] [L30] r = A [L31] d = B [L32] p = 1 [L33] q = 0 VAL [\old(counter)=0, A=8589934591, B=4294967295, counter=0, d=4294967295, p=1, q=0, r=4294967295] [L35] EXPR counter++ VAL [\old(counter)=0, A=8589934591, B=4294967295, counter=1, counter++=0, d=4294967295, p=1, q=0, r=4294967295] [L35] COND TRUE counter++<1 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(q == 0) VAL [\old(counter)=0, A=8589934591, B=4294967295, counter=1, d=4294967295, p=1, q=0, r=4294967295] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(r == A) VAL [\old(counter)=0, A=8589934591, B=4294967295, counter=1, d=4294967295, p=1, q=0, r=4294967295] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L38] RET __VERIFIER_assert(d == B * p) VAL [\old(counter)=0, A=8589934591, B=4294967295, counter=1, d=4294967295, p=1, q=0, r=4294967295] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [\old(counter)=0, A=8589934591, B=4294967295, counter=1, d=8589934590, p=2, q=0, r=4294967295] [L35] EXPR counter++ VAL [\old(counter)=0, A=8589934591, B=4294967295, counter=2, counter++=1, d=8589934590, p=2, q=0, r=4294967295] [L35] COND FALSE !(counter++<1) [L45] EXPR counter++ VAL [\old(counter)=0, A=8589934591, B=4294967295, counter=3, counter++=2, d=8589934590, p=2, q=0, r=4294967295] [L45] COND FALSE !(counter++<1) [L59] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L59] RET __VERIFIER_assert(A == d*q + r) VAL [\old(counter)=0, A=8589934591, B=4294967295, counter=3, d=8589934590, p=2, q=0, r=4294967295] [L60] CALL __VERIFIER_assert(B == d) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L15] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L17] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 590 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 348 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 339 IncrementalHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 242 mSDtfsCounter, 339 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=6, InterpolantAutomatonStates: 33, 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, 6 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 358 SizeOfPredicates, 3 NumberOfNonLiveVariables, 302 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 28/28 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! [2022-04-14 21:44:01,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...