/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/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 23:08:49,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 23:08:49,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 23:08:49,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 23:08:49,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 23:08:49,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 23:08:49,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 23:08:49,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 23:08:49,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 23:08:49,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 23:08:49,233 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 23:08:49,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 23:08:49,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 23:08:49,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 23:08:49,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 23:08:49,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 23:08:49,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 23:08:49,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 23:08:49,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 23:08:49,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 23:08:49,243 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 23:08:49,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 23:08:49,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 23:08:49,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 23:08:49,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 23:08:49,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 23:08:49,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 23:08:49,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 23:08:49,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 23:08:49,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 23:08:49,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 23:08:49,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 23:08:49,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 23:08:49,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 23:08:49,254 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 23:08:49,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 23:08:49,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 23:08:49,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 23:08:49,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 23:08:49,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 23:08:49,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 23:08:49,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 23:08:49,258 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 23:08:49,277 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 23:08:49,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 23:08:49,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 23:08:49,278 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 23:08:49,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 23:08:49,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 23:08:49,278 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 23:08:49,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 23:08:49,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 23:08:49,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 23:08:49,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 23:08:49,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 23:08:49,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 23:08:49,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 23:08:49,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 23:08:49,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 23:08:49,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 23:08:49,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 23:08:49,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 23:08:49,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:08:49,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 23:08:49,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 23:08:49,280 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 23:08:49,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 23:08:49,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 23:08:49,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 23:08:49,281 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 23:08:49,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 23:08:49,282 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 23:08:49,282 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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 23:08:49,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 23:08:49,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 23:08:49,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 23:08:49,551 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 23:08:49,552 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 23:08:49,553 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound2.c [2022-04-27 23:08:49,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6d57c8e/c71a57ea45994a7ca44de5aed349f737/FLAG2bc061f4f [2022-04-27 23:08:49,956 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 23:08:49,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound2.c [2022-04-27 23:08:49,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6d57c8e/c71a57ea45994a7ca44de5aed349f737/FLAG2bc061f4f [2022-04-27 23:08:49,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6d57c8e/c71a57ea45994a7ca44de5aed349f737 [2022-04-27 23:08:49,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 23:08:49,978 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 23:08:49,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 23:08:49,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 23:08:49,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 23:08:49,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:08:49" (1/1) ... [2022-04-27 23:08:49,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c46f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:49, skipping insertion in model container [2022-04-27 23:08:49,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:08:49" (1/1) ... [2022-04-27 23:08:49,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 23:08:50,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 23:08:50,133 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/dijkstra-u_valuebound2.c[525,538] [2022-04-27 23:08:50,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:08:50,174 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 23:08:50,182 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/dijkstra-u_valuebound2.c[525,538] [2022-04-27 23:08:50,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 23:08:50,207 INFO L208 MainTranslator]: Completed translation [2022-04-27 23:08:50,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:50 WrapperNode [2022-04-27 23:08:50,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 23:08:50,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 23:08:50,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 23:08:50,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 23:08:50,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:50" (1/1) ... [2022-04-27 23:08:50,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:50" (1/1) ... [2022-04-27 23:08:50,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:50" (1/1) ... [2022-04-27 23:08:50,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:50" (1/1) ... [2022-04-27 23:08:50,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:50" (1/1) ... [2022-04-27 23:08:50,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:50" (1/1) ... [2022-04-27 23:08:50,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:50" (1/1) ... [2022-04-27 23:08:50,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 23:08:50,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 23:08:50,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 23:08:50,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 23:08:50,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:50" (1/1) ... [2022-04-27 23:08:50,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 23:08:50,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:08:50,274 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 23:08:50,276 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 23:08:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 23:08:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 23:08:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 23:08:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 23:08:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 23:08:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 23:08:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 23:08:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 23:08:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 23:08:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 23:08:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 23:08:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 23:08:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 23:08:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 23:08:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 23:08:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 23:08:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 23:08:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 23:08:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 23:08:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 23:08:50,350 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 23:08:50,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 23:08:50,486 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 23:08:50,492 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 23:08:50,492 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 23:08:50,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:50 BoogieIcfgContainer [2022-04-27 23:08:50,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 23:08:50,495 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 23:08:50,495 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 23:08:50,496 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 23:08:50,498 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:50" (1/1) ... [2022-04-27 23:08:50,500 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 23:08:50,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:08:50 BasicIcfg [2022-04-27 23:08:50,525 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 23:08:50,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 23:08:50,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 23:08:50,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 23:08:50,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:08:49" (1/4) ... [2022-04-27 23:08:50,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46945cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:08:50, skipping insertion in model container [2022-04-27 23:08:50,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:08:50" (2/4) ... [2022-04-27 23:08:50,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46945cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:08:50, skipping insertion in model container [2022-04-27 23:08:50,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:08:50" (3/4) ... [2022-04-27 23:08:50,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46945cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:08:50, skipping insertion in model container [2022-04-27 23:08:50,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 11:08:50" (4/4) ... [2022-04-27 23:08:50,531 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound2.cqvasr [2022-04-27 23:08:50,543 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 23:08:50,543 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 23:08:50,616 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 23:08:50,621 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@3e12fdb2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@faf0a4 [2022-04-27 23:08:50,622 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 23:08:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 23:08:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 23:08:50,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:50,650 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] [2022-04-27 23:08:50,651 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:50,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:50,658 INFO L85 PathProgramCache]: Analyzing trace with hash 890522097, now seen corresponding path program 1 times [2022-04-27 23:08:50,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:50,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144404816] [2022-04-27 23:08:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:08:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:50,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {41#true} is VALID [2022-04-27 23:08:50,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:08:50,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:08:50,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:08:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:50,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: 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] {41#true} is VALID [2022-04-27 23:08:50,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:08:50,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:08:50,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 23:08:50,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 23:08:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:50,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: 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] {41#true} is VALID [2022-04-27 23:08:50,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:08:50,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:08:50,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 23:08:50,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:08:50,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {41#true} is VALID [2022-04-27 23:08:50,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:08:50,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:08:50,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#true} is VALID [2022-04-27 23:08:50,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {41#true} is VALID [2022-04-27 23:08:50,908 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-27 23:08:50,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: 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] {41#true} is VALID [2022-04-27 23:08:50,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:08:50,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:08:50,910 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 23:08:50,910 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#false} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {41#true} is VALID [2022-04-27 23:08:50,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} [114] assume_abort_if_notENTRY-->L9: 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] {41#true} is VALID [2022-04-27 23:08:50,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:08:50,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:08:50,911 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#false} is VALID [2022-04-27 23:08:50,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {42#false} is VALID [2022-04-27 23:08:50,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} [118] L30-2-->L52-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:08:50,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} [122] L52-2-->L38-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:08:50,912 INFO L272 TraceCheckUtils]: 19: Hoare triple {42#false} [127] L38-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_24 16) v_main_~p~0_22) (* v_main_~h~0_14 (* v_main_~h~0_14 v_main_~h~0_14)) (* 4294967295 (* v_main_~r~0_21 (* v_main_~p~0_22 16))) (* v_main_~h~0_14 4294967295) (* v_main_~p~0_22 4294967292) (* v_main_~r~0_21 .cse0) (* (* v_main_~n~0_24 .cse0) 4294967295))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_24, main_~h~0=v_main_~h~0_14, main_~p~0=v_main_~p~0_22, main_~r~0=v_main_~r~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {42#false} is VALID [2022-04-27 23:08:50,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} [130] __VERIFIER_assertENTRY-->L12: 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] {42#false} is VALID [2022-04-27 23:08:50,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} [133] L12-->L13: 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[] {42#false} is VALID [2022-04-27 23:08:50,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#false} is VALID [2022-04-27 23:08:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:08:50,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:50,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144404816] [2022-04-27 23:08:50,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144404816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:50,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:50,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 23:08:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872917803] [2022-04-27 23:08:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:50,921 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 23:08:50,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:50,925 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:08:50,961 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 23:08:50,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 23:08:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:50,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 23:08:50,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 23:08:50,989 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:08:53,362 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 23:08:53,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:53,519 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-27 23:08:53,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 23:08:53,519 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 23:08:53,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:08:53,520 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:08:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-27 23:08:53,530 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:08:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-27 23:08:53,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-27 23:08:53,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:53,683 INFO L225 Difference]: With dead ends: 69 [2022-04-27 23:08:53,683 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 23:08:53,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 23:08:53,694 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:08:53,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 23:08:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 23:08:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 23:08:53,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:08:53,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:08:53,727 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:08:53,728 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:08:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:53,732 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 23:08:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 23:08:53,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:53,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:53,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-27 23:08:53,734 INFO L87 Difference]: Start difference. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-27 23:08:53,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:08:53,738 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 23:08:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 23:08:53,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:08:53,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:08:53,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:08:53,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:08:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 23:08:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-27 23:08:53,744 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-27 23:08:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:08:53,744 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-27 23:08:53,744 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 23:08:53,744 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 23:08:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 23:08:53,745 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:08:53,745 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] [2022-04-27 23:08:53,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 23:08:53,746 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:08:53,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:08:53,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1386957495, now seen corresponding path program 1 times [2022-04-27 23:08:53,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:08:53,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266710435] [2022-04-27 23:08:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:08:53,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:08:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:54,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:08:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:54,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {274#true} is VALID [2022-04-27 23:08:54,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:08:54,023 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {274#true} {274#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:08:54,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:08:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:54,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} [114] assume_abort_if_notENTRY-->L9: 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] {274#true} is VALID [2022-04-27 23:08:54,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} [117] L9-->L9-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[] {274#true} is VALID [2022-04-27 23:08:54,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:08:54,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {274#true} is VALID [2022-04-27 23:08:54,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 23:08:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:08:54,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} [114] assume_abort_if_notENTRY-->L9: 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] {274#true} is VALID [2022-04-27 23:08:54,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} [117] L9-->L9-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[] {274#true} is VALID [2022-04-27 23:08:54,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:08:54,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {274#true} is VALID [2022-04-27 23:08:54,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:08:54,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {274#true} is VALID [2022-04-27 23:08:54,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:08:54,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:08:54,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:08:54,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {274#true} is VALID [2022-04-27 23:08:54,051 INFO L272 TraceCheckUtils]: 6: Hoare triple {274#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {274#true} is VALID [2022-04-27 23:08:54,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#true} [114] assume_abort_if_notENTRY-->L9: 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] {274#true} is VALID [2022-04-27 23:08:54,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#true} [117] L9-->L9-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[] {274#true} is VALID [2022-04-27 23:08:54,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:08:54,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {274#true} {274#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {274#true} is VALID [2022-04-27 23:08:54,052 INFO L272 TraceCheckUtils]: 11: Hoare triple {274#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {274#true} is VALID [2022-04-27 23:08:54,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#true} [114] assume_abort_if_notENTRY-->L9: 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] {274#true} is VALID [2022-04-27 23:08:54,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#true} [117] L9-->L9-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[] {274#true} is VALID [2022-04-27 23:08:54,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {274#true} is VALID [2022-04-27 23:08:54,053 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {274#true} {274#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {274#true} is VALID [2022-04-27 23:08:54,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {274#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 23:08:54,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 23:08:54,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {288#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 23:08:54,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {288#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 23:08:54,063 INFO L272 TraceCheckUtils]: 20: Hoare triple {288#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {289#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:08:54,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {289#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L12: 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] {290#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:08:54,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {290#(not (= __VERIFIER_assert_~cond 0))} [133] L12-->L13: 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[] {275#false} is VALID [2022-04-27 23:08:54,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {275#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#false} is VALID [2022-04-27 23:08:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:08:54,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:08:54,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266710435] [2022-04-27 23:08:54,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266710435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:08:54,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:08:54,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 23:08:54,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221892715] [2022-04-27 23:08:54,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:08:54,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 23:08:54,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:08:54,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:08:54,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:08:54,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 23:08:54,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:08:54,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 23:08:54,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 23:08:54,091 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:08:57,289 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 23:09:02,154 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 23:09:06,169 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 23:09:08,226 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 23:09:10,232 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 23:09:12,362 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 23:09:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:13,889 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-04-27 23:09:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 23:09:13,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 23:09:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:09:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:09:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-27 23:09:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:09:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-27 23:09:13,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 98 transitions. [2022-04-27 23:09:14,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:14,097 INFO L225 Difference]: With dead ends: 68 [2022-04-27 23:09:14,097 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 23:09:14,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 23:09:14,099 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 54 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2022-04-27 23:09:14,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 51 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 187 Invalid, 6 Unknown, 0 Unchecked, 17.3s Time] [2022-04-27 23:09:14,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 23:09:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 23:09:14,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:09:14,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:09:14,115 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:09:14,116 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:09:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:14,119 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 23:09:14,120 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 23:09:14,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:14,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:14,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-27 23:09:14,122 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-27 23:09:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:09:14,125 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 23:09:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 23:09:14,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:09:14,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:09:14,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:09:14,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:09:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:09:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-04-27 23:09:14,130 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 24 [2022-04-27 23:09:14,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:09:14,131 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-04-27 23:09:14,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 23:09:14,131 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 23:09:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 23:09:14,132 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:09:14,132 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] [2022-04-27 23:09:14,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 23:09:14,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:09:14,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:09:14,133 INFO L85 PathProgramCache]: Analyzing trace with hash -472493455, now seen corresponding path program 1 times [2022-04-27 23:09:14,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:09:14,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513291167] [2022-04-27 23:09:14,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:14,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:09:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:14,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 23:09:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:14,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {582#true} is VALID [2022-04-27 23:09:14,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {582#true} {582#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 23:09:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:14,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {582#true} [114] assume_abort_if_notENTRY-->L9: 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] {582#true} is VALID [2022-04-27 23:09:14,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} [117] L9-->L9-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[] {582#true} is VALID [2022-04-27 23:09:14,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:09:14,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 23:09:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:14,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {582#true} [114] assume_abort_if_notENTRY-->L9: 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] {582#true} is VALID [2022-04-27 23:09:14,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} [117] L9-->L9-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[] {582#true} is VALID [2022-04-27 23:09:14,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:09:14,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {582#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 23:09:14,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {582#true} is VALID [2022-04-27 23:09:14,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {582#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {582#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {582#true} is VALID [2022-04-27 23:09:14,346 INFO L272 TraceCheckUtils]: 6: Hoare triple {582#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:09:14,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {582#true} [114] assume_abort_if_notENTRY-->L9: 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] {582#true} is VALID [2022-04-27 23:09:14,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {582#true} [117] L9-->L9-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[] {582#true} is VALID [2022-04-27 23:09:14,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {582#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,347 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {582#true} {582#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:09:14,347 INFO L272 TraceCheckUtils]: 11: Hoare triple {582#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:09:14,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#true} [114] assume_abort_if_notENTRY-->L9: 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] {582#true} is VALID [2022-04-27 23:09:14,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {582#true} [117] L9-->L9-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[] {582#true} is VALID [2022-04-27 23:09:14,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {582#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,348 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {582#true} {582#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:09:14,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {582#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {595#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:09:14,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {595#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {595#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:09:14,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [126] L31-->L30-2: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~q~0] {596#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:09:14,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {596#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {596#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 23:09:14,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {596#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {597#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} is VALID [2022-04-27 23:09:14,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {597#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {597#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} is VALID [2022-04-27 23:09:14,354 INFO L272 TraceCheckUtils]: 22: Hoare triple {597#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {598#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 23:09:14,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {598#(not (= |__VERIFIER_assert_#in~cond| 0))} [130] __VERIFIER_assertENTRY-->L12: 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] {599#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 23:09:14,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {599#(not (= __VERIFIER_assert_~cond 0))} [133] L12-->L13: 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[] {583#false} is VALID [2022-04-27 23:09:14,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {583#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {583#false} is VALID [2022-04-27 23:09:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 23:09:14,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:09:14,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513291167] [2022-04-27 23:09:14,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513291167] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 23:09:14,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195077933] [2022-04-27 23:09:14,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:09:14,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:09:14,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:09:14,358 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 23:09:14,363 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 23:09:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:14,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 23:09:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:09:14,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:09:14,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {582#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {582#true} is VALID [2022-04-27 23:09:14,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {582#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {582#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {582#true} is VALID [2022-04-27 23:09:14,922 INFO L272 TraceCheckUtils]: 6: Hoare triple {582#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:09:14,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {582#true} [114] assume_abort_if_notENTRY-->L9: 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] {625#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 23:09:14,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {625#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [117] L9-->L9-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[] {629#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:09:14,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {629#(not (= |assume_abort_if_not_#in~cond| 0))} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {629#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:09:14,925 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {629#(not (= |assume_abort_if_not_#in~cond| 0))} {582#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {636#(<= (mod main_~n~0 4294967296) 2)} is VALID [2022-04-27 23:09:14,925 INFO L272 TraceCheckUtils]: 11: Hoare triple {636#(<= (mod main_~n~0 4294967296) 2)} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:09:14,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#true} [114] assume_abort_if_notENTRY-->L9: 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] {582#true} is VALID [2022-04-27 23:09:14,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {582#true} [117] L9-->L9-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[] {582#true} is VALID [2022-04-27 23:09:14,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {582#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:14,929 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {582#true} {636#(<= (mod main_~n~0 4294967296) 2)} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {636#(<= (mod main_~n~0 4294967296) 2)} is VALID [2022-04-27 23:09:14,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {636#(<= (mod main_~n~0 4294967296) 2)} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {655#(and (= main_~p~0 0) (= main_~q~0 1) (<= (mod main_~r~0 4294967296) 2))} is VALID [2022-04-27 23:09:14,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {655#(and (= main_~p~0 0) (= main_~q~0 1) (<= (mod main_~r~0 4294967296) 2))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {655#(and (= main_~p~0 0) (= main_~q~0 1) (<= (mod main_~r~0 4294967296) 2))} is VALID [2022-04-27 23:09:14,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {655#(and (= main_~p~0 0) (= main_~q~0 1) (<= (mod main_~r~0 4294967296) 2))} [126] L31-->L30-2: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~q~0] {662#(and (= main_~p~0 0) (= main_~q~0 4) (<= (mod main_~r~0 4294967296) 2))} is VALID [2022-04-27 23:09:14,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {662#(and (= main_~p~0 0) (= main_~q~0 4) (<= (mod main_~r~0 4294967296) 2))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {662#(and (= main_~p~0 0) (= main_~q~0 4) (<= (mod main_~r~0 4294967296) 2))} is VALID [2022-04-27 23:09:14,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {662#(and (= main_~p~0 0) (= main_~q~0 4) (<= (mod main_~r~0 4294967296) 2))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {662#(and (= main_~p~0 0) (= main_~q~0 4) (<= (mod main_~r~0 4294967296) 2))} is VALID [2022-04-27 23:09:14,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {662#(and (= main_~p~0 0) (= main_~q~0 4) (<= (mod main_~r~0 4294967296) 2))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {662#(and (= main_~p~0 0) (= main_~q~0 4) (<= (mod main_~r~0 4294967296) 2))} is VALID [2022-04-27 23:09:14,945 INFO L272 TraceCheckUtils]: 22: Hoare triple {662#(and (= main_~p~0 0) (= main_~q~0 4) (<= (mod main_~r~0 4294967296) 2))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {675#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:09:14,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {675#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L12: 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] {679#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:09:14,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {679#(<= 1 __VERIFIER_assert_~cond)} [133] L12-->L13: 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[] {583#false} is VALID [2022-04-27 23:09:14,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {583#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {583#false} is VALID [2022-04-27 23:09:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 23:09:14,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 23:09:15,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {583#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {583#false} is VALID [2022-04-27 23:09:15,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {679#(<= 1 __VERIFIER_assert_~cond)} [133] L12-->L13: 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[] {583#false} is VALID [2022-04-27 23:09:15,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {675#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L12: 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] {679#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:09:15,469 INFO L272 TraceCheckUtils]: 22: Hoare triple {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {675#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:09:15,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 23:09:15,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 23:09:15,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 23:09:15,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {708#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296))} [126] L31-->L30-2: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~q~0] {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 23:09:15,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {708#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {708#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296))} is VALID [2022-04-27 23:09:15,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {715#(< (mod main_~n~0 4294967296) 4)} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {708#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296))} is VALID [2022-04-27 23:09:15,478 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {582#true} {715#(< (mod main_~n~0 4294967296) 4)} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {715#(< (mod main_~n~0 4294967296) 4)} is VALID [2022-04-27 23:09:15,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {582#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:15,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {582#true} [117] L9-->L9-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[] {582#true} is VALID [2022-04-27 23:09:15,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#true} [114] assume_abort_if_notENTRY-->L9: 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] {582#true} is VALID [2022-04-27 23:09:15,479 INFO L272 TraceCheckUtils]: 11: Hoare triple {715#(< (mod main_~n~0 4294967296) 4)} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:09:15,482 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {629#(not (= |assume_abort_if_not_#in~cond| 0))} {582#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {715#(< (mod main_~n~0 4294967296) 4)} is VALID [2022-04-27 23:09:15,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {629#(not (= |assume_abort_if_not_#in~cond| 0))} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {629#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:09:15,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {743#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [117] L9-->L9-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[] {629#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 23:09:15,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {582#true} [114] assume_abort_if_notENTRY-->L9: 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] {743#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 23:09:15,484 INFO L272 TraceCheckUtils]: 6: Hoare triple {582#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {582#true} is VALID [2022-04-27 23:09:15,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {582#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {582#true} is VALID [2022-04-27 23:09:15,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {582#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:15,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:15,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:15,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {582#true} is VALID [2022-04-27 23:09:15,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {582#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {582#true} is VALID [2022-04-27 23:09:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 23:09:15,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195077933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 23:09:15,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 23:09:15,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2022-04-27 23:09:15,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48206814] [2022-04-27 23:09:15,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 23:09:15,488 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 26 [2022-04-27 23:09:15,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:09:15,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 23:09:15,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:09:15,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 23:09:15,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:09:15,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 23:09:15,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-04-27 23:09:15,544 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 23:09:22,020 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 23:09:24,022 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 23:09:26,023 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 23:09:28,144 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 23:09:35,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 23:09:39,624 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 23:09:41,929 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 23:09:48,283 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 23:09:52,173 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 23:09:54,184 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 23:09:56,263 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 23:09:58,570 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 23:10:00,914 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 23:10:02,919 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 23:10:04,927 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 23:10:07,083 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 23:10:09,159 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 23:10:18,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 23:10:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:18,331 INFO L93 Difference]: Finished difference Result 82 states and 116 transitions. [2022-04-27 23:10:18,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 23:10:18,336 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 26 [2022-04-27 23:10:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:10:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 23:10:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2022-04-27 23:10:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 23:10:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2022-04-27 23:10:18,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 113 transitions. [2022-04-27 23:10:18,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:18,697 INFO L225 Difference]: With dead ends: 82 [2022-04-27 23:10:18,697 INFO L226 Difference]: Without dead ends: 62 [2022-04-27 23:10:18,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2022-04-27 23:10:18,699 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 61 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 123 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.9s IncrementalHoareTripleChecker+Time [2022-04-27 23:10:18,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 112 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 637 Invalid, 18 Unknown, 0 Unchecked, 48.9s Time] [2022-04-27 23:10:18,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-27 23:10:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-04-27 23:10:18,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:10:18,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 60 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:10:18,733 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 60 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:10:18,734 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 60 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:10:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:18,744 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2022-04-27 23:10:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-04-27 23:10:18,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:18,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:18,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 62 states. [2022-04-27 23:10:18,751 INFO L87 Difference]: Start difference. First operand has 60 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 62 states. [2022-04-27 23:10:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:18,755 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2022-04-27 23:10:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-04-27 23:10:18,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:18,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:18,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:10:18,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:10:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 23:10:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2022-04-27 23:10:18,758 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 26 [2022-04-27 23:10:18,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:10:18,759 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2022-04-27 23:10:18,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 23:10:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2022-04-27 23:10:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 23:10:18,760 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:10:18,760 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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 23:10:18,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 23:10:18,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:10:18,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:10:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:10:18,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1385093780, now seen corresponding path program 1 times [2022-04-27 23:10:18,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:10:18,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704211677] [2022-04-27 23:10:18,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:18,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:10:18,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:10:18,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175327493] [2022-04-27 23:10:18,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:18,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:10:18,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:10:18,994 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 23:10:19,000 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 23:10:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:19,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 23:10:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:19,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:10:19,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {1133#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#true} is VALID [2022-04-27 23:10:19,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {1133#true} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {1133#true} is VALID [2022-04-27 23:10:19,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {1133#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#true} is VALID [2022-04-27 23:10:19,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1133#true} {1133#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#true} is VALID [2022-04-27 23:10:19,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {1133#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#true} is VALID [2022-04-27 23:10:19,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {1133#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1133#true} is VALID [2022-04-27 23:10:19,303 INFO L272 TraceCheckUtils]: 6: Hoare triple {1133#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1133#true} is VALID [2022-04-27 23:10:19,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {1133#true} [114] assume_abort_if_notENTRY-->L9: 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] {1133#true} is VALID [2022-04-27 23:10:19,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {1133#true} [117] L9-->L9-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[] {1133#true} is VALID [2022-04-27 23:10:19,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {1133#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#true} is VALID [2022-04-27 23:10:19,305 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1133#true} {1133#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1133#true} is VALID [2022-04-27 23:10:19,305 INFO L272 TraceCheckUtils]: 11: Hoare triple {1133#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1133#true} is VALID [2022-04-27 23:10:19,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {1133#true} [114] assume_abort_if_notENTRY-->L9: 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] {1133#true} is VALID [2022-04-27 23:10:19,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {1133#true} [117] L9-->L9-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[] {1133#true} is VALID [2022-04-27 23:10:19,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {1133#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#true} is VALID [2022-04-27 23:10:19,306 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1133#true} {1133#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1133#true} is VALID [2022-04-27 23:10:19,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {1133#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:10:19,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:10:19,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:10:19,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:10:19,308 INFO L272 TraceCheckUtils]: 20: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1133#true} is VALID [2022-04-27 23:10:19,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {1133#true} [130] __VERIFIER_assertENTRY-->L12: 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] {1133#true} is VALID [2022-04-27 23:10:19,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {1133#true} [134] L12-->L12-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[] {1133#true} is VALID [2022-04-27 23:10:19,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {1133#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#true} is VALID [2022-04-27 23:10:19,310 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1133#true} {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [151] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:10:19,310 INFO L272 TraceCheckUtils]: 25: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [131] L39-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1133#true} is VALID [2022-04-27 23:10:19,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {1133#true} [130] __VERIFIER_assertENTRY-->L12: 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] {1133#true} is VALID [2022-04-27 23:10:19,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {1133#true} [134] L12-->L12-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[] {1133#true} is VALID [2022-04-27 23:10:19,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {1133#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1133#true} is VALID [2022-04-27 23:10:19,314 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1133#true} {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [152] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 23:10:19,315 INFO L272 TraceCheckUtils]: 30: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} [135] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* 4294967295 (* v_main_~q~0_18 (* v_main_~n~0_20 .cse0))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_20 16))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_20, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1229#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:10:19,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {1229#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L12: 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] {1233#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:10:19,316 INFO L290 TraceCheckUtils]: 32: Hoare triple {1233#(<= 1 __VERIFIER_assert_~cond)} [133] L12-->L13: 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[] {1134#false} is VALID [2022-04-27 23:10:19,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {1134#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1134#false} is VALID [2022-04-27 23:10:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 23:10:19,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:10:19,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:10:19,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704211677] [2022-04-27 23:10:19,317 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:10:19,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175327493] [2022-04-27 23:10:19,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175327493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:10:19,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:10:19,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:10:19,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636982569] [2022-04-27 23:10:19,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:10:19,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 23:10:19,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:10:19,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:19,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:19,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:10:19,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:10:19,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:10:19,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:10:19,348 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:24,641 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 23:10:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:27,393 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2022-04-27 23:10:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:10:27,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 23:10:27,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:10:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 23:10:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 23:10:27,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-27 23:10:27,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:27,467 INFO L225 Difference]: With dead ends: 70 [2022-04-27 23:10:27,468 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 23:10:27,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:10:27,469 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 23:10:27,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 23:10:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 23:10:27,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 23:10:27,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:10:27,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:10:27,485 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:10:27,486 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:10:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:27,488 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 23:10:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-27 23:10:27,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:27,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:27,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 47 states. [2022-04-27 23:10:27,489 INFO L87 Difference]: Start difference. First operand has 47 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 47 states. [2022-04-27 23:10:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:27,492 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 23:10:27,492 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-27 23:10:27,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:27,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:27,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:10:27,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:10:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:10:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2022-04-27 23:10:27,495 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 34 [2022-04-27 23:10:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:10:27,495 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2022-04-27 23:10:27,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-27 23:10:27,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 23:10:27,496 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:10:27,496 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 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 23:10:27,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 23:10:27,700 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,SelfDestructingSolverStorable3 [2022-04-27 23:10:27,701 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:10:27,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:10:27,701 INFO L85 PathProgramCache]: Analyzing trace with hash 419889614, now seen corresponding path program 1 times [2022-04-27 23:10:27,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:10:27,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048671608] [2022-04-27 23:10:27,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:27,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:10:27,718 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:10:27,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1605040438] [2022-04-27 23:10:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:27,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:10:27,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:10:27,720 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 23:10:27,746 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 23:10:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:27,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 23:10:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 23:10:27,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 23:10:27,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {1514#true} [106] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-27 23:10:27,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#true} [108] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {1514#true} is VALID [2022-04-27 23:10:27,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {1514#true} [111] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-27 23:10:27,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-27 23:10:27,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {1514#true} [107] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-27 23:10:27,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {1514#true} [110] mainENTRY-->L23: Formula: (= v_main_~n~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~n~0=v_main_~n~0_1, main_~h~0=v_main_~h~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1} AuxVars[] AssignedVars[main_~q~0, main_#t~nondet4, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1514#true} is VALID [2022-04-27 23:10:27,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {1514#true} [112] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-27 23:10:27,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {1514#true} [114] assume_abort_if_notENTRY-->L9: 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] {1514#true} is VALID [2022-04-27 23:10:27,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {1514#true} [117] L9-->L9-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[] {1514#true} is VALID [2022-04-27 23:10:27,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {1514#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-27 23:10:27,975 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1514#true} {1514#true} [149] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~n~0_17 4294967296) 2) 1 0)) InVars {main_~n~0=v_main_~n~0_17} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-27 23:10:27,975 INFO L272 TraceCheckUtils]: 11: Hoare triple {1514#true} [113] L23-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-27 23:10:27,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {1514#true} [114] assume_abort_if_notENTRY-->L9: 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] {1514#true} is VALID [2022-04-27 23:10:27,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {1514#true} [117] L9-->L9-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[] {1514#true} is VALID [2022-04-27 23:10:27,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {1514#true} [121] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-27 23:10:27,976 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1514#true} {1514#true} [150] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (< (mod v_main_~n~0_18 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_18} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {1514#true} is VALID [2022-04-27 23:10:27,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {1514#true} [115] L24-->L30-2: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_6 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_6, main_~h~0=v_main_~h~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2} AuxVars[] AssignedVars[main_~q~0, main_~h~0, main_~p~0, main_~r~0] {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:27,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:27,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} [126] L31-->L30-2: Formula: (and (= v_main_~q~0_4 (* v_main_~q~0_5 4)) (<= (mod v_main_~q~0_5 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_8} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[main_~q~0] {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:27,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} [120] L30-2-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:27,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} [125] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_7 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:27,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} [124] L52-2-->L39: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:27,979 INFO L272 TraceCheckUtils]: 22: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} [128] L39-->__VERIFIER_assertENTRY: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1514#true} is VALID [2022-04-27 23:10:27,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {1514#true} [130] __VERIFIER_assertENTRY-->L12: 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] {1514#true} is VALID [2022-04-27 23:10:27,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {1514#true} [134] L12-->L12-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[] {1514#true} is VALID [2022-04-27 23:10:27,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {1514#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-27 23:10:27,980 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1514#true} {1567#(and (= main_~p~0 0) (= main_~h~0 0))} [151] __VERIFIER_assertEXIT-->L39-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (mod v_main_~r~0_15 4294967296) (mod (+ v_main_~q~0_16 (* v_main_~p~0_16 2)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_16, main_~p~0=v_main_~p~0_16, main_~r~0=v_main_~r~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0] {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:27,980 INFO L272 TraceCheckUtils]: 27: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} [131] L39-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1514#true} is VALID [2022-04-27 23:10:27,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {1514#true} [130] __VERIFIER_assertENTRY-->L12: 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] {1514#true} is VALID [2022-04-27 23:10:27,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {1514#true} [134] L12-->L12-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[] {1514#true} is VALID [2022-04-27 23:10:27,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {1514#true} [139] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1514#true} is VALID [2022-04-27 23:10:27,982 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1514#true} {1567#(and (= main_~p~0 0) (= main_~h~0 0))} [152] __VERIFIER_assertEXIT-->L40: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (* v_main_~n~0_19 v_main_~q~0_17) 4294967296) (mod (+ (* v_main_~p~0_17 v_main_~p~0_17) (* v_main_~q~0_17 v_main_~r~0_16)) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~q~0=v_main_~q~0_17, main_~n~0=v_main_~n~0_19, main_~p~0=v_main_~p~0_17, main_~r~0=v_main_~r~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 23:10:27,983 INFO L272 TraceCheckUtils]: 32: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} [135] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (= (mod (let ((.cse0 (* v_main_~h~0_11 12))) (+ (* v_main_~r~0_17 (* v_main_~q~0_18 .cse0)) (* 4294967295 (* v_main_~r~0_17 (* v_main_~q~0_18 (* v_main_~p~0_18 16)))) (* (* v_main_~q~0_18 (* v_main_~q~0_18 (* v_main_~p~0_18 4))) 4294967295) (* 4294967295 (* v_main_~q~0_18 (* v_main_~n~0_20 .cse0))) (* 4294967295 (* v_main_~q~0_18 (* v_main_~h~0_11 v_main_~q~0_18))) (* v_main_~q~0_18 (* v_main_~p~0_18 (* v_main_~n~0_20 16))) (* v_main_~h~0_11 (* v_main_~h~0_11 v_main_~h~0_11)))) 4294967296) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_18, main_~n~0=v_main_~n~0_20, main_~h~0=v_main_~h~0_11, main_~p~0=v_main_~p~0_18, main_~r~0=v_main_~r~0_17} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~h~0, main_~n~0, main_~p~0, main_~r~0] {1616#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 23:10:27,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {1616#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __VERIFIER_assertENTRY-->L12: 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] {1620#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 23:10:27,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {1620#(<= 1 __VERIFIER_assert_~cond)} [133] L12-->L13: 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[] {1515#false} is VALID [2022-04-27 23:10:27,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {1515#false} [137] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1515#false} is VALID [2022-04-27 23:10:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 23:10:27,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 23:10:27,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 23:10:27,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048671608] [2022-04-27 23:10:27,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 23:10:27,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605040438] [2022-04-27 23:10:27,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605040438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 23:10:27,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 23:10:27,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 23:10:27,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334465704] [2022-04-27 23:10:27,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 23:10:27,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 23:10:27,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 23:10:27,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:28,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:28,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 23:10:28,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 23:10:28,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 23:10:28,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 23:10:28,019 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:34,076 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-27 23:10:34,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 23:10:34,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 23:10:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 23:10:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-27 23:10:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-27 23:10:34,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-27 23:10:34,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 23:10:34,143 INFO L225 Difference]: With dead ends: 57 [2022-04-27 23:10:34,143 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 23:10:34,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 23:10:34,144 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-27 23:10:34,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 151 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-27 23:10:34,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 23:10:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 23:10:34,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 23:10:34,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:10:34,162 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:10:34,163 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:10:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:34,165 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-04-27 23:10:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-04-27 23:10:34,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:34,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:34,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 55 states. [2022-04-27 23:10:34,166 INFO L87 Difference]: Start difference. First operand has 55 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 55 states. [2022-04-27 23:10:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 23:10:34,168 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-04-27 23:10:34,168 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-04-27 23:10:34,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 23:10:34,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 23:10:34,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 23:10:34,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 23:10:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 23:10:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2022-04-27 23:10:34,172 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 36 [2022-04-27 23:10:34,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 23:10:34,172 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2022-04-27 23:10:34,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 23:10:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-04-27 23:10:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 23:10:34,173 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 23:10:34,173 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 23:10:34,195 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 23:10:34,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:10:34,388 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 23:10:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 23:10:34,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1513839050, now seen corresponding path program 1 times [2022-04-27 23:10:34,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 23:10:34,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060379226] [2022-04-27 23:10:34,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:34,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 23:10:34,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 23:10:34,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [958624750] [2022-04-27 23:10:34,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 23:10:34,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 23:10:34,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 23:10:34,408 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 23:10:34,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process