/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/divbin2_valuebound5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 17:57:45,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:57:45,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:57:45,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:57:45,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:57:45,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:57:45,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:57:45,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:57:45,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:57:45,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:57:45,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:57:45,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:57:45,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:57:45,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:57:45,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:57:45,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:57:45,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:57:45,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:57:45,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:57:45,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:57:45,367 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:57:45,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:57:45,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:57:45,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:57:45,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:57:45,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:57:45,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:57:45,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:57:45,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:57:45,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:57:45,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:57:45,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:57:45,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:57:45,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:57:45,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:57:45,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:57:45,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:57:45,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:57:45,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:57:45,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:57:45,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:57:45,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:57:45,376 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 17:57:45,386 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:57:45,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:57:45,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:57:45,387 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:57:45,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:57:45,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:57:45,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:57:45,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:57:45,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:57:45,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:57:45,388 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:57:45,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:57:45,388 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:57:45,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:57:45,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:57:45,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:57:45,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:57:45,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:57:45,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:57:45,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:57:45,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:57:45,389 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:57:45,389 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-27 17:57:45,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:57:45,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:57:45,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:57:45,563 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:57:45,564 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:57:45,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound5.i [2022-04-27 17:57:45,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340569583/10f5f9ce08d2413286138c48630e797b/FLAG1b83dd69c [2022-04-27 17:57:45,977 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:57:45,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound5.i [2022-04-27 17:57:45,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340569583/10f5f9ce08d2413286138c48630e797b/FLAG1b83dd69c [2022-04-27 17:57:45,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/340569583/10f5f9ce08d2413286138c48630e797b [2022-04-27 17:57:45,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:57:45,996 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:57:45,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:57:45,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:57:45,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:57:46,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:57:45" (1/1) ... [2022-04-27 17:57:46,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4164c04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:57:46, skipping insertion in model container [2022-04-27 17:57:46,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:57:45" (1/1) ... [2022-04-27 17:57:46,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:57:46,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:57:46,150 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/divbin2_valuebound5.i[951,964] [2022-04-27 17:57:46,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:57:46,168 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:57:46,176 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/divbin2_valuebound5.i[951,964] [2022-04-27 17:57:46,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:57:46,189 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:57:46,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:57:46 WrapperNode [2022-04-27 17:57:46,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:57:46,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:57:46,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:57:46,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:57:46,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:57:46" (1/1) ... [2022-04-27 17:57:46,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:57:46" (1/1) ... [2022-04-27 17:57:46,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:57:46" (1/1) ... [2022-04-27 17:57:46,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:57:46" (1/1) ... [2022-04-27 17:57:46,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:57:46" (1/1) ... [2022-04-27 17:57:46,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:57:46" (1/1) ... [2022-04-27 17:57:46,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:57:46" (1/1) ... [2022-04-27 17:57:46,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:57:46,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:57:46,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:57:46,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:57:46,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:57:46" (1/1) ... [2022-04-27 17:57:46,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:57:46,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:57:46,240 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-27 17:57:46,244 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-27 17:57:46,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:57:46,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:57:46,263 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:57:46,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 17:57:46,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 17:57:46,264 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:57:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 17:57:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:57:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 17:57:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 17:57:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:57:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:57:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 17:57:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 17:57:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 17:57:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:57:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:57:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:57:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:57:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:57:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:57:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:57:46,305 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:57:46,306 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:57:46,400 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:57:46,405 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:57:46,405 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 17:57:46,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:57:46 BoogieIcfgContainer [2022-04-27 17:57:46,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:57:46,407 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:57:46,407 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:57:46,408 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:57:46,410 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:57:46" (1/1) ... [2022-04-27 17:57:46,412 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:57:46,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:57:46 BasicIcfg [2022-04-27 17:57:46,438 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:57:46,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:57:46,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:57:46,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:57:46,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:57:45" (1/4) ... [2022-04-27 17:57:46,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eca2a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:57:46, skipping insertion in model container [2022-04-27 17:57:46,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:57:46" (2/4) ... [2022-04-27 17:57:46,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eca2a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:57:46, skipping insertion in model container [2022-04-27 17:57:46,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:57:46" (3/4) ... [2022-04-27 17:57:46,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eca2a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:57:46, skipping insertion in model container [2022-04-27 17:57:46,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:57:46" (4/4) ... [2022-04-27 17:57:46,456 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound5.iJordan [2022-04-27 17:57:46,466 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:57:46,466 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:57:46,512 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:57:46,516 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@155cedbb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5beff874 [2022-04-27 17:57:46,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:57:46,524 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 17:57:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 17:57:46,530 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:57:46,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:57:46,530 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:57:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:57:46,534 INFO L85 PathProgramCache]: Analyzing trace with hash 483266332, now seen corresponding path program 1 times [2022-04-27 17:57:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:57:46,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183665961] [2022-04-27 17:57:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:57:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:57:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:57:46,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:57:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:57:46,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {33#true} is VALID [2022-04-27 17:57:46,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 17:57:46,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 17:57:46,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:57:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:57:46,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [95] assume_abort_if_notENTRY-->L16: 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] {33#true} is VALID [2022-04-27 17:57:46,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [99] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 17:57:46,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 17:57:46,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} [122] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-27 17:57:46,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:57:46,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [89] 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) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {33#true} is VALID [2022-04-27 17:57:46,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 17:57:46,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 17:57:46,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-27 17:57:46,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {33#true} is VALID [2022-04-27 17:57:46,674 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-27 17:57:46,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [95] assume_abort_if_notENTRY-->L16: 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] {33#true} is VALID [2022-04-27 17:57:46,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [99] L16-->L16-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 17:57:46,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 17:57:46,675 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} [122] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-27 17:57:46,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {34#false} is VALID [2022-04-27 17:57:46,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} [96] L34-2-->L43-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 17:57:46,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} [101] L43-2-->L38-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 17:57:46,676 INFO L272 TraceCheckUtils]: 14: Hoare triple {34#false} [107] L38-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ v_main_~r~0_11 (* v_main_~q~0_10 v_main_~b~0_14)) 4294967296) (mod v_main_~A~0_10 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_10, main_~A~0=v_main_~A~0_10, main_~b~0=v_main_~b~0_14, main_~r~0=v_main_~r~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {34#false} is VALID [2022-04-27 17:57:46,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} [110] __VERIFIER_assertENTRY-->L19: 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] {34#false} is VALID [2022-04-27 17:57:46,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} [114] L19-->L20: 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[] {34#false} is VALID [2022-04-27 17:57:46,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-27 17:57:46,677 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-27 17:57:46,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:57:46,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183665961] [2022-04-27 17:57:46,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183665961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:57:46,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:57:46,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 17:57:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037116703] [2022-04-27 17:57:46,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:57:46,683 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-27 17:57:46,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:57:46,686 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-27 17:57:46,703 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-27 17:57:46,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 17:57:46,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:57:46,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 17:57:46,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:57:46,720 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-27 17:57:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:57:46,783 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-27 17:57:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 17:57:46,784 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-27 17:57:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:57:46,785 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-27 17:57:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 17:57:46,790 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-27 17:57:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-27 17:57:46,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-27 17:57:46,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:57:46,835 INFO L225 Difference]: With dead ends: 30 [2022-04-27 17:57:46,836 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 17:57:46,837 INFO L412 NwaCegarLoop]: 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-27 17:57:46,839 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:57:46,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:57:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 17:57:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 17:57:46,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:57:46,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 17:57:46,860 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 17:57:46,860 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 17:57:46,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:57:46,865 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 17:57:46,866 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 17:57:46,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:57:46,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:57:46,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 17:57:46,867 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 17:57:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:57:46,869 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 17:57:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 17:57:46,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:57:46,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:57:46,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:57:46,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:57:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 17:57:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 17:57:46,873 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-27 17:57:46,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:57:46,873 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 17:57:46,874 INFO L496 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-27 17:57:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 17:57:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 17:57:46,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:57:46,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:57:46,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:57:46,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:57:46,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:57:46,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2138426952, now seen corresponding path program 1 times [2022-04-27 17:57:46,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:57:46,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515921147] [2022-04-27 17:57:46,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:57:46,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:57:46,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:57:46,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [722736002] [2022-04-27 17:57:46,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:57:46,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:57:46,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:57:46,898 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-27 17:57:46,916 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-27 17:57:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:57:46,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 17:57:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:57:46,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:57:47,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {150#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#true} is VALID [2022-04-27 17:57:47,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#true} [89] 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) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {150#true} is VALID [2022-04-27 17:57:47,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {150#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#true} is VALID [2022-04-27 17:57:47,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {150#true} {150#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#true} is VALID [2022-04-27 17:57:47,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {150#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#true} is VALID [2022-04-27 17:57:47,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {150#true} is VALID [2022-04-27 17:57:47,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {150#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {150#true} is VALID [2022-04-27 17:57:47,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {150#true} [95] assume_abort_if_notENTRY-->L16: 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] {150#true} is VALID [2022-04-27 17:57:47,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {150#true} [100] L16-->L16-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[] {150#true} is VALID [2022-04-27 17:57:47,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {150#true} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {150#true} is VALID [2022-04-27 17:57:47,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {150#true} {150#true} [122] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {150#true} is VALID [2022-04-27 17:57:47,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {150#true} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {188#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:57:47,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {188#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {188#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:57:47,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {188#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {195#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:57:47,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {195#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 17:57:47,267 INFO L272 TraceCheckUtils]: 15: Hoare triple {195#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {202#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:57:47,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#(<= 1 |__VERIFIER_assert_#in~cond|)} [110] __VERIFIER_assertENTRY-->L19: 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] {206#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:57:47,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {206#(<= 1 __VERIFIER_assert_~cond)} [114] L19-->L20: 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[] {151#false} is VALID [2022-04-27 17:57:47,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {151#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {151#false} is VALID [2022-04-27 17:57:47,269 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-27 17:57:47,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:57:47,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:57:47,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515921147] [2022-04-27 17:57:47,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:57:47,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722736002] [2022-04-27 17:57:47,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722736002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:57:47,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:57:47,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 17:57:47,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772297042] [2022-04-27 17:57:47,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:57:47,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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 19 [2022-04-27 17:57:47,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:57:47,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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-27 17:57:47,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:57:47,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 17:57:47,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:57:47,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 17:57:47,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 17:57:47,300 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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-27 17:57:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:57:47,463 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 17:57:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 17:57:47,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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 19 [2022-04-27 17:57:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:57:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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-27 17:57:47,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 17:57:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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-27 17:57:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 17:57:47,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-27 17:57:47,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:57:47,508 INFO L225 Difference]: With dead ends: 35 [2022-04-27 17:57:47,508 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 17:57:47,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-27 17:57:47,510 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:57:47,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:57:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 17:57:47,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 17:57:47,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:57:47,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 17:57:47,518 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 17:57:47,520 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 17:57:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:57:47,523 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 17:57:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 17:57:47,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:57:47,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:57:47,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 17:57:47,524 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 17:57:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:57:47,529 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 17:57:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 17:57:47,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:57:47,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:57:47,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:57:47,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:57:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 17:57:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 17:57:47,541 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-27 17:57:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:57:47,541 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 17:57:47,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 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-27 17:57:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 17:57:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 17:57:47,544 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:57:47,544 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:57:47,563 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-27 17:57:47,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:57:47,756 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:57:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:57:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash -554838191, now seen corresponding path program 1 times [2022-04-27 17:57:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:57:47,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056742326] [2022-04-27 17:57:47,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:57:47,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:57:47,770 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:57:47,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818794851] [2022-04-27 17:57:47,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:57:47,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:57:47,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:57:47,771 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-27 17:57:47,772 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-27 17:57:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:57:47,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-27 17:57:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:57:47,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:57:48,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {351#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {351#true} is VALID [2022-04-27 17:57:48,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {351#true} [89] 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) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {351#true} is VALID [2022-04-27 17:57:48,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {351#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {351#true} is VALID [2022-04-27 17:57:48,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {351#true} is VALID [2022-04-27 17:57:48,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {351#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {351#true} is VALID [2022-04-27 17:57:48,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {351#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {351#true} is VALID [2022-04-27 17:57:48,142 INFO L272 TraceCheckUtils]: 6: Hoare triple {351#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {351#true} is VALID [2022-04-27 17:57:48,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {351#true} [95] assume_abort_if_notENTRY-->L16: 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] {377#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 17:57:48,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [100] L16-->L16-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[] {381#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 17:57:48,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {381#(not (= |assume_abort_if_not_#in~cond| 0))} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 17:57:48,144 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {381#(not (= |assume_abort_if_not_#in~cond| 0))} {351#true} [122] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {388#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-27 17:57:48,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {388#(<= (mod main_~A~0 4294967296) 5)} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {392#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:57:48,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {392#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {392#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:57:48,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {392#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {399#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:57:48,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {399#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {399#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:57:48,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {399#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {406#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 17:57:48,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {406#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 17:57:48,149 INFO L272 TraceCheckUtils]: 17: Hoare triple {406#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {413#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:57:48,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {413#(<= 1 |__VERIFIER_assert_#in~cond|)} [110] __VERIFIER_assertENTRY-->L19: 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] {417#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:57:48,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {417#(<= 1 __VERIFIER_assert_~cond)} [114] L19-->L20: 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[] {352#false} is VALID [2022-04-27 17:57:48,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {352#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {352#false} is VALID [2022-04-27 17:57:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:57:48,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:57:48,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {352#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {352#false} is VALID [2022-04-27 17:57:48,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {417#(<= 1 __VERIFIER_assert_~cond)} [114] L19-->L20: 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[] {352#false} is VALID [2022-04-27 17:57:48,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {413#(<= 1 |__VERIFIER_assert_#in~cond|)} [110] __VERIFIER_assertENTRY-->L19: 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] {417#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:57:48,573 INFO L272 TraceCheckUtils]: 17: Hoare triple {433#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {413#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:57:48,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {433#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {433#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 17:57:48,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {440#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {433#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 17:57:48,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {440#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {440#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 17:57:50,580 WARN L290 TraceCheckUtils]: 13: Hoare triple {447#(or (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~q~0 (* main_~b~0 2))) 4294967296)))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {440#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is UNKNOWN [2022-04-27 17:57:50,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {447#(or (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~q~0 (* main_~b~0 2))) 4294967296)))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {447#(or (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~q~0 (* main_~b~0 2))) 4294967296)))} is VALID [2022-04-27 17:57:50,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {351#true} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {447#(or (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~q~0 (* main_~b~0 2))) 4294967296)))} is VALID [2022-04-27 17:57:50,582 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {351#true} {351#true} [122] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {351#true} is VALID [2022-04-27 17:57:50,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {351#true} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {351#true} is VALID [2022-04-27 17:57:50,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {351#true} [100] L16-->L16-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[] {351#true} is VALID [2022-04-27 17:57:50,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {351#true} [95] assume_abort_if_notENTRY-->L16: 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] {351#true} is VALID [2022-04-27 17:57:50,583 INFO L272 TraceCheckUtils]: 6: Hoare triple {351#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {351#true} is VALID [2022-04-27 17:57:50,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {351#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {351#true} is VALID [2022-04-27 17:57:50,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {351#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {351#true} is VALID [2022-04-27 17:57:50,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {351#true} is VALID [2022-04-27 17:57:50,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {351#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {351#true} is VALID [2022-04-27 17:57:50,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {351#true} [89] 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) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {351#true} is VALID [2022-04-27 17:57:50,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {351#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {351#true} is VALID [2022-04-27 17:57:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:57:50,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:57:50,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056742326] [2022-04-27 17:57:50,584 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:57:50,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818794851] [2022-04-27 17:57:50,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818794851] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 17:57:50,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 17:57:50,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2022-04-27 17:57:50,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535042742] [2022-04-27 17:57:50,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 17:57:50,585 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2022-04-27 17:57:50,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:57:50,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:57:52,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 17:57:52,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 17:57:52,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:57:52,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 17:57:52,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-27 17:57:52,630 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:57:58,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:58:05,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:58:10,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 17:58:13,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:58:16,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:58:19,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:58:21,866 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:58:23,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:58:26,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 17:58:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:58:26,467 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-04-27 17:58:26,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 17:58:26,468 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2022-04-27 17:58:26,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:58:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:58:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2022-04-27 17:58:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:58:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 76 transitions. [2022-04-27 17:58:26,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 76 transitions. [2022-04-27 17:58:28,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 17:58:28,818 INFO L225 Difference]: With dead ends: 62 [2022-04-27 17:58:28,818 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 17:58:28,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-27 17:58:28,819 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 52 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 28 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:58:28,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 137 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 170 Invalid, 9 Unknown, 0 Unchecked, 22.1s Time] [2022-04-27 17:58:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 17:58:28,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2022-04-27 17:58:28,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:58:28,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 17:58:28,824 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 17:58:28,824 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 17:58:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:58:28,826 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-04-27 17:58:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-27 17:58:28,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:58:28,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:58:28,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 59 states. [2022-04-27 17:58:28,827 INFO L87 Difference]: Start difference. First operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 59 states. [2022-04-27 17:58:28,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:58:28,829 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2022-04-27 17:58:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-04-27 17:58:28,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:58:28,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:58:28,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:58:28,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:58:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 17:58:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2022-04-27 17:58:28,832 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 21 [2022-04-27 17:58:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:58:28,832 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2022-04-27 17:58:28,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 17:58:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-04-27 17:58:28,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 17:58:28,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:58:28,833 INFO L195 NwaCegarLoop]: trace histogram [2, 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-27 17:58:28,858 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-27 17:58:29,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 17:58:29,050 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:58:29,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:58:29,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1600606598, now seen corresponding path program 1 times [2022-04-27 17:58:29,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:58:29,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428946534] [2022-04-27 17:58:29,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:58:29,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:58:29,060 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:58:29,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [929277857] [2022-04-27 17:58:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:58:29,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:58:29,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:58:29,061 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-27 17:58:29,062 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-27 17:58:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:58:29,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 17:58:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:58:29,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:58:29,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {727#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-27 17:58:29,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {727#true} [89] 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) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {727#true} is VALID [2022-04-27 17:58:29,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {727#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-27 17:58:29,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {727#true} {727#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-27 17:58:29,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {727#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-27 17:58:29,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {727#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {727#true} is VALID [2022-04-27 17:58:29,182 INFO L272 TraceCheckUtils]: 6: Hoare triple {727#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {727#true} is VALID [2022-04-27 17:58:29,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {727#true} [95] assume_abort_if_notENTRY-->L16: 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] {727#true} is VALID [2022-04-27 17:58:29,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {727#true} [100] L16-->L16-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[] {727#true} is VALID [2022-04-27 17:58:29,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {727#true} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-27 17:58:29,183 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {727#true} {727#true} [122] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {727#true} is VALID [2022-04-27 17:58:29,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {727#true} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {765#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 17:58:29,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {765#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {765#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 17:58:29,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {765#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {765#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 17:58:29,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {765#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {765#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 17:58:29,185 INFO L272 TraceCheckUtils]: 15: Hoare triple {765#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {727#true} is VALID [2022-04-27 17:58:29,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {727#true} [110] __VERIFIER_assertENTRY-->L19: 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] {727#true} is VALID [2022-04-27 17:58:29,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {727#true} [115] L19-->L19-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[] {727#true} is VALID [2022-04-27 17:58:29,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {727#true} [120] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {727#true} is VALID [2022-04-27 17:58:29,192 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {727#true} {765#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [124] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {765#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 17:58:29,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {765#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} [112] L39-1-->L43: Formula: (let ((.cse0 (mod v_main_~b~0_5 4294967296))) (and (not (= (mod v_main_~B~0_3 4294967296) .cse0)) (= v_main_~b~0_4 (div .cse0 2)) (= v_main_~q~0_3 (* v_main_~q~0_4 2)))) InVars {main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {728#false} is VALID [2022-04-27 17:58:29,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {728#false} [116] L43-->L43-2: Formula: (and (= (+ v_main_~q~0_7 1) v_main_~q~0_6) (= v_main_~r~0_4 (+ (* (- 1) v_main_~b~0_7) v_main_~r~0_5)) (<= (mod v_main_~b~0_7 4294967296) (mod v_main_~r~0_5 4294967296))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {728#false} is VALID [2022-04-27 17:58:29,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {728#false} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#false} is VALID [2022-04-27 17:58:29,193 INFO L272 TraceCheckUtils]: 23: Hoare triple {728#false} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {728#false} is VALID [2022-04-27 17:58:29,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {728#false} [110] __VERIFIER_assertENTRY-->L19: 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] {728#false} is VALID [2022-04-27 17:58:29,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {728#false} [114] L19-->L20: 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[] {728#false} is VALID [2022-04-27 17:58:29,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {728#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {728#false} is VALID [2022-04-27 17:58:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:58:29,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:58:29,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:58:29,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428946534] [2022-04-27 17:58:29,194 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:58:29,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929277857] [2022-04-27 17:58:29,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929277857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:58:29,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:58:29,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 17:58:29,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236983025] [2022-04-27 17:58:29,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:58:29,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 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 27 [2022-04-27 17:58:29,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:58:29,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 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-27 17:58:29,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:58:29,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 17:58:29,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:58:29,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 17:58:29,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 17:58:29,214 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 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-27 17:58:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:58:29,276 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-27 17:58:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 17:58:29,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 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 27 [2022-04-27 17:58:29,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:58:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 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-27 17:58:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 17:58:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 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-27 17:58:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 17:58:29,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-27 17:58:29,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:58:29,305 INFO L225 Difference]: With dead ends: 47 [2022-04-27 17:58:29,305 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 17:58:29,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-27 17:58:29,306 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 17:58:29,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 17:58:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 17:58:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-27 17:58:29,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:58:29,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 17:58:29,309 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 17:58:29,309 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 17:58:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:58:29,310 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-27 17:58:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-27 17:58:29,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:58:29,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:58:29,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-27 17:58:29,311 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 40 states. [2022-04-27 17:58:29,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:58:29,312 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-27 17:58:29,312 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-27 17:58:29,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:58:29,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:58:29,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:58:29,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:58:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 17:58:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-04-27 17:58:29,314 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 27 [2022-04-27 17:58:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:58:29,314 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-04-27 17:58:29,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 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-27 17:58:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-27 17:58:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 17:58:29,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:58:29,314 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:58:29,332 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-27 17:58:29,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:58:29,529 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:58:29,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:58:29,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1889469796, now seen corresponding path program 2 times [2022-04-27 17:58:29,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:58:29,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823937233] [2022-04-27 17:58:29,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:58:29,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:58:29,541 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:58:29,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1423346677] [2022-04-27 17:58:29,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 17:58:29,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:58:29,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:58:29,543 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-27 17:58:29,543 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-27 17:58:29,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 17:58:29,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 17:58:29,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 17:58:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:58:29,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:58:29,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {977#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {977#true} is VALID [2022-04-27 17:58:29,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {977#true} [89] 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) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {977#true} is VALID [2022-04-27 17:58:29,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {977#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {977#true} is VALID [2022-04-27 17:58:29,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {977#true} {977#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {977#true} is VALID [2022-04-27 17:58:29,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {977#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {977#true} is VALID [2022-04-27 17:58:29,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {977#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {977#true} is VALID [2022-04-27 17:58:29,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {977#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {977#true} is VALID [2022-04-27 17:58:29,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {977#true} [95] assume_abort_if_notENTRY-->L16: 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] {1003#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 17:58:29,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {1003#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [100] L16-->L16-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[] {1007#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 17:58:29,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {1007#(not (= |assume_abort_if_not_#in~cond| 0))} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1007#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 17:58:29,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1007#(not (= |assume_abort_if_not_#in~cond| 0))} {977#true} [122] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1014#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-27 17:58:29,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {1014#(<= (mod main_~A~0 4294967296) 5)} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:29,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:29,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:29,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:29,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:29,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:29,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:29,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:29,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:29,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:29,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:29,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:29,964 INFO L272 TraceCheckUtils]: 23: Hoare triple {1018#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1055#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:58:29,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {1055#(<= 1 |__VERIFIER_assert_#in~cond|)} [110] __VERIFIER_assertENTRY-->L19: 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] {1059#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:58:29,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {1059#(<= 1 __VERIFIER_assert_~cond)} [114] L19-->L20: 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[] {978#false} is VALID [2022-04-27 17:58:29,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {978#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {978#false} is VALID [2022-04-27 17:58:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-27 17:58:29,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 17:58:29,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:58:29,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823937233] [2022-04-27 17:58:29,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:58:29,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423346677] [2022-04-27 17:58:29,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423346677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:58:29,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:58:29,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 17:58:29,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873194231] [2022-04-27 17:58:29,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:58:29,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 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 27 [2022-04-27 17:58:29,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:58:29,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 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-27 17:58:30,048 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-27 17:58:30,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 17:58:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:58:30,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 17:58:30,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 17:58:30,049 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 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-27 17:58:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:58:30,782 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-27 17:58:30,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 17:58:30,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 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 27 [2022-04-27 17:58:30,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:58:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 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-27 17:58:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 17:58:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 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-27 17:58:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-27 17:58:30,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-27 17:58:30,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:58:30,959 INFO L225 Difference]: With dead ends: 49 [2022-04-27 17:58:30,959 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 17:58:30,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 17:58:30,960 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 17:58:30,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 17:58:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 17:58:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2022-04-27 17:58:30,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:58:30,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 17:58:30,962 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 17:58:30,962 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 17:58:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:58:30,964 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 17:58:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 17:58:30,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:58:30,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:58:30,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 48 states. [2022-04-27 17:58:30,964 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 48 states. [2022-04-27 17:58:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:58:30,966 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-27 17:58:30,966 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-04-27 17:58:30,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:58:30,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:58:30,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:58:30,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:58:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 17:58:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-27 17:58:30,967 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2022-04-27 17:58:30,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:58:30,967 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-27 17:58:30,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 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-27 17:58:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-27 17:58:30,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 17:58:30,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:58:30,968 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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-27 17:58:30,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 17:58:31,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:58:31,179 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:58:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:58:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1664896543, now seen corresponding path program 1 times [2022-04-27 17:58:31,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:58:31,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294931098] [2022-04-27 17:58:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:58:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:58:31,189 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 17:58:31,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767100078] [2022-04-27 17:58:31,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:58:31,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 17:58:31,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:58:31,190 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 17:58:31,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 17:58:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:58:31,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 17:58:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:58:31,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 17:58:32,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {1249#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1249#true} is VALID [2022-04-27 17:58:32,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {1249#true} [89] 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) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {1249#true} is VALID [2022-04-27 17:58:32,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {1249#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1249#true} is VALID [2022-04-27 17:58:32,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1249#true} {1249#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1249#true} is VALID [2022-04-27 17:58:32,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {1249#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1249#true} is VALID [2022-04-27 17:58:32,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {1249#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {1249#true} is VALID [2022-04-27 17:58:32,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {1249#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1249#true} is VALID [2022-04-27 17:58:32,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {1249#true} [95] assume_abort_if_notENTRY-->L16: 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] {1275#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 17:58:32,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {1275#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [100] L16-->L16-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[] {1279#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 17:58:32,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {1279#(not (= |assume_abort_if_not_#in~cond| 0))} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1279#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 17:58:32,162 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1279#(not (= |assume_abort_if_not_#in~cond| 0))} {1249#true} [122] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1286#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-27 17:58:32,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {1286#(<= (mod main_~A~0 4294967296) 5)} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {1290#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:32,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {1290#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1290#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:32,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {1290#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1297#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:32,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {1297#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1297#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} is VALID [2022-04-27 17:58:32,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {1297#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (<= (mod main_~A~0 4294967296) 5) (= main_~q~0 0))} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {1304#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 17:58:32,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {1304#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1304#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 17:58:32,164 INFO L272 TraceCheckUtils]: 17: Hoare triple {1304#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1249#true} is VALID [2022-04-27 17:58:32,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {1249#true} [110] __VERIFIER_assertENTRY-->L19: 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] {1249#true} is VALID [2022-04-27 17:58:32,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {1249#true} [115] L19-->L19-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[] {1249#true} is VALID [2022-04-27 17:58:32,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {1249#true} [120] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1249#true} is VALID [2022-04-27 17:58:32,165 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1249#true} {1304#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [124] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1304#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 17:58:32,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {1304#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} [112] L39-1-->L43: Formula: (let ((.cse0 (mod v_main_~b~0_5 4294967296))) (and (not (= (mod v_main_~B~0_3 4294967296) .cse0)) (= v_main_~b~0_4 (div .cse0 2)) (= v_main_~q~0_3 (* v_main_~q~0_4 2)))) InVars {main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {1326#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (< (mod main_~r~0 4294967296) 2) (= main_~q~0 0))} is VALID [2022-04-27 17:58:32,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {1326#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (< (mod main_~r~0 4294967296) 2) (= main_~q~0 0))} [116] L43-->L43-2: Formula: (and (= (+ v_main_~q~0_7 1) v_main_~q~0_6) (= v_main_~r~0_4 (+ (* (- 1) v_main_~b~0_7) v_main_~r~0_5)) (<= (mod v_main_~b~0_7 4294967296) (mod v_main_~r~0_5 4294967296))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1330#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (= (+ (- 1) main_~q~0) 0) (< (mod main_~A~0 4294967296) 2) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-27 17:58:32,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {1330#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (= (+ (- 1) main_~q~0) 0) (< (mod main_~A~0 4294967296) 2) (<= 1 (mod main_~A~0 4294967296)))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1330#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (= (+ (- 1) main_~q~0) 0) (< (mod main_~A~0 4294967296) 2) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-27 17:58:32,168 INFO L272 TraceCheckUtils]: 25: Hoare triple {1330#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (= (+ (- 1) main_~q~0) 0) (< (mod main_~A~0 4294967296) 2) (<= 1 (mod main_~A~0 4294967296)))} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:58:32,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {1337#(<= 1 |__VERIFIER_assert_#in~cond|)} [110] __VERIFIER_assertENTRY-->L19: 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] {1341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:58:32,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {1341#(<= 1 __VERIFIER_assert_~cond)} [114] L19-->L20: 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[] {1250#false} is VALID [2022-04-27 17:58:32,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {1250#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1250#false} is VALID [2022-04-27 17:58:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:58:32,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 17:59:26,438 WARN L232 SmtUtils]: Spent 11.30s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 17:59:35,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {1250#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1250#false} is VALID [2022-04-27 17:59:35,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {1341#(<= 1 __VERIFIER_assert_~cond)} [114] L19-->L20: 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[] {1250#false} is VALID [2022-04-27 17:59:35,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {1337#(<= 1 |__VERIFIER_assert_#in~cond|)} [110] __VERIFIER_assertENTRY-->L19: 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] {1341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 17:59:35,175 INFO L272 TraceCheckUtils]: 25: Hoare triple {1357#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 17:59:35,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {1357#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1357#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 17:59:37,186 WARN L290 TraceCheckUtils]: 23: Hoare triple {1357#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} [116] L43-->L43-2: Formula: (and (= (+ v_main_~q~0_7 1) v_main_~q~0_6) (= v_main_~r~0_4 (+ (* (- 1) v_main_~b~0_7) v_main_~r~0_5)) (<= (mod v_main_~b~0_7 4294967296) (mod v_main_~r~0_5 4294967296))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1357#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-27 17:59:39,249 WARN L290 TraceCheckUtils]: 22: Hoare triple {1367#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} [112] L39-1-->L43: Formula: (let ((.cse0 (mod v_main_~b~0_5 4294967296))) (and (not (= (mod v_main_~B~0_3 4294967296) .cse0)) (= v_main_~b~0_4 (div .cse0 2)) (= v_main_~q~0_3 (* v_main_~q~0_4 2)))) InVars {main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {1357#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-27 17:59:39,250 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1249#true} {1367#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} [124] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1367#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 17:59:39,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {1249#true} [120] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1249#true} is VALID [2022-04-27 17:59:39,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {1249#true} [115] L19-->L19-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[] {1249#true} is VALID [2022-04-27 17:59:39,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {1249#true} [110] __VERIFIER_assertENTRY-->L19: 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] {1249#true} is VALID [2022-04-27 17:59:39,250 INFO L272 TraceCheckUtils]: 17: Hoare triple {1367#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1249#true} is VALID [2022-04-27 17:59:39,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {1367#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1367#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 17:59:39,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {1389#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {1367#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 17:59:39,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {1389#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1389#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 17:59:41,363 WARN L290 TraceCheckUtils]: 13: Hoare triple {1396#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1389#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is UNKNOWN [2022-04-27 17:59:41,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {1396#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1396#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 17:59:41,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {1249#true} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {1396#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 17:59:41,366 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1249#true} {1249#true} [122] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1249#true} is VALID [2022-04-27 17:59:41,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {1249#true} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1249#true} is VALID [2022-04-27 17:59:41,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {1249#true} [100] L16-->L16-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[] {1249#true} is VALID [2022-04-27 17:59:41,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {1249#true} [95] assume_abort_if_notENTRY-->L16: 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] {1249#true} is VALID [2022-04-27 17:59:41,367 INFO L272 TraceCheckUtils]: 6: Hoare triple {1249#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1249#true} is VALID [2022-04-27 17:59:41,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {1249#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {1249#true} is VALID [2022-04-27 17:59:41,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {1249#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1249#true} is VALID [2022-04-27 17:59:41,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1249#true} {1249#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1249#true} is VALID [2022-04-27 17:59:41,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {1249#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1249#true} is VALID [2022-04-27 17:59:41,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {1249#true} [89] 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) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {1249#true} is VALID [2022-04-27 17:59:41,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {1249#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1249#true} is VALID [2022-04-27 17:59:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 17:59:41,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:59:41,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294931098] [2022-04-27 17:59:41,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 17:59:41,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767100078] [2022-04-27 17:59:41,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767100078] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 17:59:41,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 17:59:41,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2022-04-27 17:59:41,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69004863] [2022-04-27 17:59:41,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 17:59:41,368 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2022-04-27 17:59:41,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:59:41,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 17:59:47,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 42 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 17:59:47,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 17:59:47,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:59:47,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 17:59:47,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=174, Unknown=11, NotChecked=0, Total=240 [2022-04-27 17:59:47,608 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 17:59:58,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:00:02,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:00:07,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:00:13,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:00:18,094 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~b~0 4294967296)) (.cse0 (mod c_main_~A~0 4294967296)) (.cse2 (* c_main_~q~0 2))) (and (= .cse0 (mod (+ c_main_~r~0 (* c_main_~b~0 c_main_~q~0)) 4294967296)) (= .cse0 (mod (+ (* (div .cse1 2) .cse2) c_main_~r~0) 4294967296)) (<= .cse0 5) (let ((.cse4 (mod (* c_main_~b~0 2) 4294967296)) (.cse3 (mod c_main_~r~0 4294967296))) (or (not (<= .cse1 .cse3)) (= .cse0 (mod (+ (* (div .cse4 2) .cse2) c_main_~r~0) 4294967296)) (<= .cse4 .cse3))))) is different from false [2022-04-27 18:00:20,270 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~b~0 4294967296)) (.cse5 (mod c_main_~r~0 4294967296))) (let ((.cse3 (<= .cse1 .cse5)) (.cse0 (mod c_main_~A~0 4294967296)) (.cse2 (* c_main_~q~0 2))) (and (or (= .cse0 (mod (+ (* (div .cse1 2) .cse2) c_main_~r~0) 4294967296)) .cse3) (let ((.cse4 (mod (* c_main_~b~0 2) 4294967296))) (or (not .cse3) (= .cse0 (mod (+ (* (div .cse4 2) .cse2) c_main_~r~0) 4294967296)) (<= .cse4 .cse5)))))) is different from true [2022-04-27 18:00:22,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:00:24,632 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:00:26,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:00:28,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:00:31,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:00:35,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:00:41,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:00:44,077 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:00:48,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:01:18,649 WARN L232 SmtUtils]: Spent 17.21s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 18:01:22,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:01:38,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:01:40,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 18:01:42,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 18:01:44,901 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:01:47,068 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:01:51,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:01:53,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:01:55,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:01:58,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:02:00,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:02:02,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:02:05,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:02:07,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:02:09,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:02:25,827 WARN L232 SmtUtils]: Spent 11.84s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 18:02:27,836 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:02:29,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:02:34,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:02:36,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:02:38,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:02:43,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:02:45,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:02:58,350 WARN L232 SmtUtils]: Spent 12.72s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 18:03:00,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:02,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:04,819 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:07,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:25,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:28,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:30,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:32,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:34,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:36,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:40,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:43,020 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:51,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:53,927 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:56,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:03:58,180 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:04:00,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:04:02,455 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:04:04,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:04:06,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:04:09,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:04:11,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:04:13,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:04:15,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:04:17,918 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:04:20,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:04:22,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:04:24,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 18:04:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:04:24,860 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-27 18:04:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 18:04:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 29 [2022-04-27 18:04:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:04:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 18:04:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-27 18:04:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 18:04:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-27 18:04:24,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 94 transitions. [2022-04-27 18:04:31,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 91 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 18:04:31,274 INFO L225 Difference]: With dead ends: 86 [2022-04-27 18:04:31,274 INFO L226 Difference]: Without dead ends: 84 [2022-04-27 18:04:31,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 107.2s TimeCoverageRelationStatistics Valid=94, Invalid=315, Unknown=19, NotChecked=78, Total=506 [2022-04-27 18:04:31,274 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 29 mSolverCounterUnsat, 63 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 130.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 63 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 136.3s IncrementalHoareTripleChecker+Time [2022-04-27 18:04:31,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 217 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 235 Invalid, 63 Unknown, 3 Unchecked, 136.3s Time] [2022-04-27 18:04:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-27 18:04:31,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2022-04-27 18:04:31,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:04:31,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 62 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 18:04:31,279 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 62 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 18:04:31,280 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 62 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 18:04:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:04:31,284 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2022-04-27 18:04:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2022-04-27 18:04:31,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:04:31,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:04:31,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 84 states. [2022-04-27 18:04:31,285 INFO L87 Difference]: Start difference. First operand has 62 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 84 states. [2022-04-27 18:04:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:04:31,288 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2022-04-27 18:04:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2022-04-27 18:04:31,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:04:31,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:04:31,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:04:31,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:04:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 18:04:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-27 18:04:31,290 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 29 [2022-04-27 18:04:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:04:31,290 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-27 18:04:31,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 18:04:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-27 18:04:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 18:04:31,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:04:31,291 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 18:04:31,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 18:04:31,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:04:31,501 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:04:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:04:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1142360470, now seen corresponding path program 2 times [2022-04-27 18:04:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:04:31,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488188087] [2022-04-27 18:04:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:04:31,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:04:31,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:04:31,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [905377160] [2022-04-27 18:04:31,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 18:04:31,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:04:31,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:04:31,519 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 18:04:31,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 18:04:31,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 18:04:31,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 18:04:31,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-27 18:04:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 18:04:31,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 18:04:31,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {1768#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1768#true} is VALID [2022-04-27 18:04:31,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {1768#true} [89] 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) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {1768#true} is VALID [2022-04-27 18:04:31,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {1768#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1768#true} is VALID [2022-04-27 18:04:31,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1768#true} {1768#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1768#true} is VALID [2022-04-27 18:04:31,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {1768#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1768#true} is VALID [2022-04-27 18:04:31,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {1768#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {1768#true} is VALID [2022-04-27 18:04:31,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {1768#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1768#true} is VALID [2022-04-27 18:04:31,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {1768#true} [95] assume_abort_if_notENTRY-->L16: 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] {1794#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 18:04:31,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {1794#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [100] L16-->L16-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[] {1798#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:04:31,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {1798#(not (= |assume_abort_if_not_#in~cond| 0))} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1798#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:04:31,804 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1798#(not (= |assume_abort_if_not_#in~cond| 0))} {1768#true} [122] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1805#(<= (mod main_~A~0 4294967296) 5)} is VALID [2022-04-27 18:04:31,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {1805#(<= (mod main_~A~0 4294967296) 5)} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {1809#(and (= main_~b~0 1) (<= (mod main_~r~0 4294967296) 5))} is VALID [2022-04-27 18:04:31,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {1809#(and (= main_~b~0 1) (<= (mod main_~r~0 4294967296) 5))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1809#(and (= main_~b~0 1) (<= (mod main_~r~0 4294967296) 5))} is VALID [2022-04-27 18:04:31,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {1809#(and (= main_~b~0 1) (<= (mod main_~r~0 4294967296) 5))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1816#(and (= main_~b~0 2) (<= (mod main_~r~0 4294967296) 5))} is VALID [2022-04-27 18:04:31,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {1816#(and (= main_~b~0 2) (<= (mod main_~r~0 4294967296) 5))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1816#(and (= main_~b~0 2) (<= (mod main_~r~0 4294967296) 5))} is VALID [2022-04-27 18:04:31,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {1816#(and (= main_~b~0 2) (<= (mod main_~r~0 4294967296) 5))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1823#(and (= main_~b~0 4) (<= (mod main_~r~0 4294967296) 5))} is VALID [2022-04-27 18:04:31,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {1823#(and (= main_~b~0 4) (<= (mod main_~r~0 4294967296) 5))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1823#(and (= main_~b~0 4) (<= (mod main_~r~0 4294967296) 5))} is VALID [2022-04-27 18:04:31,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#(and (= main_~b~0 4) (<= (mod main_~r~0 4294967296) 5))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1830#(and (= main_~b~0 8) (<= (mod main_~r~0 4294967296) 5))} is VALID [2022-04-27 18:04:31,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {1830#(and (= main_~b~0 8) (<= (mod main_~r~0 4294967296) 5))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1830#(and (= main_~b~0 8) (<= (mod main_~r~0 4294967296) 5))} is VALID [2022-04-27 18:04:31,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {1830#(and (= main_~b~0 8) (<= (mod main_~r~0 4294967296) 5))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1769#false} is VALID [2022-04-27 18:04:31,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {1769#false} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#false} is VALID [2022-04-27 18:04:31,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {1769#false} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {1769#false} is VALID [2022-04-27 18:04:31,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {1769#false} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#false} is VALID [2022-04-27 18:04:31,808 INFO L272 TraceCheckUtils]: 23: Hoare triple {1769#false} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1769#false} is VALID [2022-04-27 18:04:31,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {1769#false} [110] __VERIFIER_assertENTRY-->L19: 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] {1769#false} is VALID [2022-04-27 18:04:31,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {1769#false} [115] L19-->L19-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[] {1769#false} is VALID [2022-04-27 18:04:31,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {1769#false} [120] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#false} is VALID [2022-04-27 18:04:31,808 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1769#false} {1769#false} [124] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1769#false} is VALID [2022-04-27 18:04:31,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {1769#false} [112] L39-1-->L43: Formula: (let ((.cse0 (mod v_main_~b~0_5 4294967296))) (and (not (= (mod v_main_~B~0_3 4294967296) .cse0)) (= v_main_~b~0_4 (div .cse0 2)) (= v_main_~q~0_3 (* v_main_~q~0_4 2)))) InVars {main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {1769#false} is VALID [2022-04-27 18:04:31,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {1769#false} [116] L43-->L43-2: Formula: (and (= (+ v_main_~q~0_7 1) v_main_~q~0_6) (= v_main_~r~0_4 (+ (* (- 1) v_main_~b~0_7) v_main_~r~0_5)) (<= (mod v_main_~b~0_7 4294967296) (mod v_main_~r~0_5 4294967296))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1769#false} is VALID [2022-04-27 18:04:31,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {1769#false} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#false} is VALID [2022-04-27 18:04:31,808 INFO L272 TraceCheckUtils]: 31: Hoare triple {1769#false} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1769#false} is VALID [2022-04-27 18:04:31,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {1769#false} [110] __VERIFIER_assertENTRY-->L19: 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] {1769#false} is VALID [2022-04-27 18:04:31,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {1769#false} [114] L19-->L20: 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[] {1769#false} is VALID [2022-04-27 18:04:31,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {1769#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#false} is VALID [2022-04-27 18:04:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 18:04:31,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 18:04:32,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {1769#false} [118] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#false} is VALID [2022-04-27 18:04:32,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {1769#false} [114] L19-->L20: 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[] {1769#false} is VALID [2022-04-27 18:04:32,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {1769#false} [110] __VERIFIER_assertENTRY-->L19: 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] {1769#false} is VALID [2022-04-27 18:04:32,323 INFO L272 TraceCheckUtils]: 31: Hoare triple {1769#false} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1769#false} is VALID [2022-04-27 18:04:32,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {1769#false} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#false} is VALID [2022-04-27 18:04:32,324 INFO L290 TraceCheckUtils]: 29: Hoare triple {1769#false} [116] L43-->L43-2: Formula: (and (= (+ v_main_~q~0_7 1) v_main_~q~0_6) (= v_main_~r~0_4 (+ (* (- 1) v_main_~b~0_7) v_main_~r~0_5)) (<= (mod v_main_~b~0_7 4294967296) (mod v_main_~r~0_5 4294967296))) InVars {main_~q~0=v_main_~q~0_7, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_5} OutVars{main_~q~0=v_main_~q~0_6, main_~b~0=v_main_~b~0_7, main_~r~0=v_main_~r~0_4} AuxVars[] AssignedVars[main_~q~0, main_~r~0] {1769#false} is VALID [2022-04-27 18:04:32,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {1769#false} [112] L39-1-->L43: Formula: (let ((.cse0 (mod v_main_~b~0_5 4294967296))) (and (not (= (mod v_main_~B~0_3 4294967296) .cse0)) (= v_main_~b~0_4 (div .cse0 2)) (= v_main_~q~0_3 (* v_main_~q~0_4 2)))) InVars {main_~q~0=v_main_~q~0_4, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_5} OutVars{main_~q~0=v_main_~q~0_3, main_~B~0=v_main_~B~0_3, main_~b~0=v_main_~b~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0] {1769#false} is VALID [2022-04-27 18:04:32,324 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1768#true} {1769#false} [124] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1769#false} is VALID [2022-04-27 18:04:32,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {1768#true} [120] L19-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1768#true} is VALID [2022-04-27 18:04:32,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {1768#true} [115] L19-->L19-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[] {1768#true} is VALID [2022-04-27 18:04:32,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {1768#true} [110] __VERIFIER_assertENTRY-->L19: 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] {1768#true} is VALID [2022-04-27 18:04:32,324 INFO L272 TraceCheckUtils]: 23: Hoare triple {1769#false} [108] L39-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (+ v_main_~r~0_10 (* v_main_~q~0_9 v_main_~b~0_13)) 4294967296) (mod v_main_~A~0_9 4294967296)) 1 0)) InVars {main_~q~0=v_main_~q~0_9, main_~A~0=v_main_~A~0_9, main_~b~0=v_main_~b~0_13, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~A~0, main_~b~0, main_~r~0] {1768#true} is VALID [2022-04-27 18:04:32,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {1769#false} [103] L43-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#false} is VALID [2022-04-27 18:04:32,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {1769#false} [104] L35-->L43-2: Formula: (not (<= (mod v_main_~b~0_10 4294967296) (mod v_main_~r~0_8 4294967296))) InVars {main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~r~0=v_main_~r~0_8} AuxVars[] AssignedVars[] {1769#false} is VALID [2022-04-27 18:04:32,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {1769#false} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#false} is VALID [2022-04-27 18:04:32,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {1927#(not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1769#false} is VALID [2022-04-27 18:04:32,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {1927#(not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1927#(not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 18:04:32,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {1934#(not (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1927#(not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 18:04:32,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {1934#(not (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1934#(not (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 18:04:32,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {1941#(not (<= (mod (* main_~b~0 4) 4294967296) (mod main_~r~0 4294967296)))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1934#(not (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 18:04:32,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {1941#(not (<= (mod (* main_~b~0 4) 4294967296) (mod main_~r~0 4294967296)))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1941#(not (<= (mod (* main_~b~0 4) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 18:04:32,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {1948#(not (<= (mod (* main_~b~0 8) 4294967296) (mod main_~r~0 4294967296)))} [105] L35-->L34-2: Formula: (and (<= (mod v_main_~b~0_12 4294967296) (mod v_main_~r~0_9 4294967296)) (= (* 2 v_main_~b~0_12) v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_12, main_~r~0=v_main_~r~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~r~0=v_main_~r~0_9} AuxVars[] AssignedVars[main_~b~0] {1941#(not (<= (mod (* main_~b~0 4) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 18:04:32,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {1948#(not (<= (mod (* main_~b~0 8) 4294967296) (mod main_~r~0 4294967296)))} [98] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1948#(not (<= (mod (* main_~b~0 8) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 18:04:32,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {1955#(not (<= 8 (mod main_~A~0 4294967296)))} [94] L29-1-->L34-2: Formula: (and (= v_main_~B~0_4 v_main_~b~0_6) (= v_main_~q~0_5 0) (= v_main_~B~0_4 1) (= v_main_~A~0_6 v_main_~r~0_3)) InVars {main_~A~0=v_main_~A~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~B~0=v_main_~B~0_4, main_~b~0=v_main_~b~0_6, main_~A~0=v_main_~A~0_6, main_~r~0=v_main_~r~0_3} AuxVars[] AssignedVars[main_~q~0, main_~B~0, main_~b~0, main_~r~0] {1948#(not (<= (mod (* main_~b~0 8) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 18:04:32,338 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1798#(not (= |assume_abort_if_not_#in~cond| 0))} {1768#true} [122] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1955#(not (<= 8 (mod main_~A~0 4294967296)))} is VALID [2022-04-27 18:04:32,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {1798#(not (= |assume_abort_if_not_#in~cond| 0))} [106] L16-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1798#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:04:32,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {1968#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [100] L16-->L16-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[] {1798#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 18:04:32,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {1768#true} [95] assume_abort_if_notENTRY-->L16: 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] {1968#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 18:04:32,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {1768#true} [93] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~A~0_8 4294967296) 5) 1 0)) InVars {main_~A~0=v_main_~A~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {1768#true} is VALID [2022-04-27 18:04:32,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {1768#true} [91] mainENTRY-->L29: Formula: (= v_main_~A~0_2 |v_main_#t~nondet1_2|) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~q~0=v_main_~q~0_2, main_~B~0=v_main_~B~0_2, main_~A~0=v_main_~A~0_2, main_~b~0=v_main_~b~0_3, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet1, main_~B~0, main_~A~0, main_~b~0, main_~r~0] {1768#true} is VALID [2022-04-27 18:04:32,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {1768#true} [88] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1768#true} is VALID [2022-04-27 18:04:32,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1768#true} {1768#true} [121] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1768#true} is VALID [2022-04-27 18:04:32,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {1768#true} [92] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1768#true} is VALID [2022-04-27 18:04:32,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {1768#true} [89] 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) (= (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))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#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[#NULL.offset, #NULL.base] {1768#true} is VALID [2022-04-27 18:04:32,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {1768#true} [87] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1768#true} is VALID [2022-04-27 18:04:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 18:04:32,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 18:04:32,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488188087] [2022-04-27 18:04:32,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 18:04:32,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905377160] [2022-04-27 18:04:32,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905377160] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 18:04:32,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 18:04:32,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-04-27 18:04:32,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60517739] [2022-04-27 18:04:32,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 18:04:32,341 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2022-04-27 18:04:32,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 18:04:32,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 18:04:32,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:04:32,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 18:04:32,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 18:04:32,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 18:04:32,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-04-27 18:04:32,384 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 18:04:36,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 18:04:38,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 18:04:45,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 18:04:49,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 18:04:52,768 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 18:04:54,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 18:04:57,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 18:04:59,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 18:05:01,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 18:05:03,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 18:05:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:05:04,243 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2022-04-27 18:05:04,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 18:05:04,243 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2022-04-27 18:05:04,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 18:05:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 18:05:04,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-27 18:05:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 18:05:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-27 18:05:04,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2022-04-27 18:05:04,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 18:05:04,340 INFO L225 Difference]: With dead ends: 89 [2022-04-27 18:05:04,341 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 18:05:04,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-04-27 18:05:04,341 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 52 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 44 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2022-04-27 18:05:04,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 263 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 229 Invalid, 10 Unknown, 0 Unchecked, 25.9s Time] [2022-04-27 18:05:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 18:05:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 60. [2022-04-27 18:05:04,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 18:05:04,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 60 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 18:05:04,346 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 60 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 18:05:04,347 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 60 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 18:05:04,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:05:04,365 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2022-04-27 18:05:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2022-04-27 18:05:04,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:05:04,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:05:04,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 89 states. [2022-04-27 18:05:04,366 INFO L87 Difference]: Start difference. First operand has 60 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 89 states. [2022-04-27 18:05:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 18:05:04,379 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2022-04-27 18:05:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 111 transitions. [2022-04-27 18:05:04,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 18:05:04,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 18:05:04,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 18:05:04,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 18:05:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 18:05:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2022-04-27 18:05:04,382 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 35 [2022-04-27 18:05:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 18:05:04,382 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2022-04-27 18:05:04,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 18:05:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2022-04-27 18:05:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 18:05:04,383 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 18:05:04,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 18:05:04,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 18:05:04,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:05:04,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 18:05:04,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 18:05:04,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1815734547, now seen corresponding path program 3 times [2022-04-27 18:05:04,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 18:05:04,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472930655] [2022-04-27 18:05:04,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 18:05:04,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 18:05:04,644 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 18:05:04,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652002544] [2022-04-27 18:05:04,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 18:05:04,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 18:05:04,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 18:05:04,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 18:05:04,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process