/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 18:32:22,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 18:32:22,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 18:32:22,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 18:32:22,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 18:32:22,571 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 18:32:22,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 18:32:22,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 18:32:22,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 18:32:22,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 18:32:22,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 18:32:22,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 18:32:22,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 18:32:22,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 18:32:22,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 18:32:22,590 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 18:32:22,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 18:32:22,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 18:32:22,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 18:32:22,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 18:32:22,599 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 18:32:22,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 18:32:22,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 18:32:22,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 18:32:22,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 18:32:22,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 18:32:22,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 18:32:22,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 18:32:22,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 18:32:22,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 18:32:22,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 18:32:22,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 18:32:22,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 18:32:22,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 18:32:22,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 18:32:22,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 18:32:22,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 18:32:22,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 18:32:22,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 18:32:22,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 18:32:22,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 18:32:22,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 18:32:22,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 18:32:22,629 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 18:32:22,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 18:32:22,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 18:32:22,631 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 18:32:22,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 18:32:22,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 18:32:22,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 18:32:22,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 18:32:22,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 18:32:22,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 18:32:22,632 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 18:32:22,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 18:32:22,632 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 18:32:22,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 18:32:22,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 18:32:22,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 18:32:22,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 18:32:22,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 18:32:22,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 18:32:22,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 18:32:22,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 18:32:22,634 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 18:32:22,634 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 18:32:22,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 18:32:22,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 18:32:22,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 18:32:22,889 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 18:32:22,891 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 18:32:22,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2022-04-07 18:32:22,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93586a88/66db56097bcf479ea68e4ebd784329ed/FLAG55f5f1d25 [2022-04-07 18:32:23,285 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 18:32:23,285 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound2.c [2022-04-07 18:32:23,291 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93586a88/66db56097bcf479ea68e4ebd784329ed/FLAG55f5f1d25 [2022-04-07 18:32:23,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c93586a88/66db56097bcf479ea68e4ebd784329ed [2022-04-07 18:32:23,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 18:32:23,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 18:32:23,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 18:32:23,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 18:32:23,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 18:32:23,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 06:32:23" (1/1) ... [2022-04-07 18:32:23,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a2b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:23, skipping insertion in model container [2022-04-07 18:32:23,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 06:32:23" (1/1) ... [2022-04-07 18:32:23,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 18:32:23,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 18:32:23,517 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_unwindbound2.c[525,538] [2022-04-07 18:32:23,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 18:32:23,583 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 18:32:23,592 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_unwindbound2.c[525,538] [2022-04-07 18:32:23,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 18:32:23,624 INFO L208 MainTranslator]: Completed translation [2022-04-07 18:32:23,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:23 WrapperNode [2022-04-07 18:32:23,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 18:32:23,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 18:32:23,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 18:32:23,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 18:32:23,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:23" (1/1) ... [2022-04-07 18:32:23,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:23" (1/1) ... [2022-04-07 18:32:23,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:23" (1/1) ... [2022-04-07 18:32:23,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:23" (1/1) ... [2022-04-07 18:32:23,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:23" (1/1) ... [2022-04-07 18:32:23,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:23" (1/1) ... [2022-04-07 18:32:23,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:23" (1/1) ... [2022-04-07 18:32:23,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 18:32:23,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 18:32:23,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 18:32:23,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 18:32:23,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:23" (1/1) ... [2022-04-07 18:32:23,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 18:32:23,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:32:23,696 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-07 18:32:23,712 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-07 18:32:23,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 18:32:23,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 18:32:23,743 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 18:32:23,743 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 18:32:23,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 18:32:23,743 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 18:32:23,743 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 18:32:23,743 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 18:32:23,743 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 18:32:23,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 18:32:23,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 18:32:23,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 18:32:23,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 18:32:23,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 18:32:23,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 18:32:23,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 18:32:23,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 18:32:23,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 18:32:23,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 18:32:23,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 18:32:23,804 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 18:32:23,805 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 18:32:24,019 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 18:32:24,026 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 18:32:24,026 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 18:32:24,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:32:24 BoogieIcfgContainer [2022-04-07 18:32:24,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 18:32:24,028 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 18:32:24,028 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 18:32:24,033 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 18:32:24,036 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:32:24" (1/1) ... [2022-04-07 18:32:24,044 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 18:32:24,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 06:32:24 BasicIcfg [2022-04-07 18:32:24,092 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 18:32:24,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 18:32:24,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 18:32:24,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 18:32:24,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 06:32:23" (1/4) ... [2022-04-07 18:32:24,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f561348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 06:32:24, skipping insertion in model container [2022-04-07 18:32:24,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 06:32:23" (2/4) ... [2022-04-07 18:32:24,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f561348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 06:32:24, skipping insertion in model container [2022-04-07 18:32:24,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 06:32:24" (3/4) ... [2022-04-07 18:32:24,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f561348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 06:32:24, skipping insertion in model container [2022-04-07 18:32:24,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 06:32:24" (4/4) ... [2022-04-07 18:32:24,098 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound2.cJordan [2022-04-07 18:32:24,102 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 18:32:24,102 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 18:32:24,138 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 18:32:24,142 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 18:32:24,142 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 18:32:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 18:32:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 18:32:24,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:32:24,166 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:32:24,167 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:32:24,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:32:24,175 INFO L85 PathProgramCache]: Analyzing trace with hash -460462115, now seen corresponding path program 1 times [2022-04-07 18:32:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:32:24,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721505342] [2022-04-07 18:32:24,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:32:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:32:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:24,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 18:32:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:24,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {42#true} is VALID [2022-04-07 18:32:24,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 18:32:24,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 18:32:24,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 18:32:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:24,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} [113] 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] {42#true} is VALID [2022-04-07 18:32:24,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 18:32:24,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 18:32:24,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {43#false} is VALID [2022-04-07 18:32:24,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 18:32:24,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {42#true} is VALID [2022-04-07 18:32:24,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 18:32:24,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 18:32:24,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 18:32:24,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [109] mainENTRY-->L24: 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] {42#true} is VALID [2022-04-07 18:32:24,394 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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#true} is VALID [2022-04-07 18:32:24,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [113] 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] {42#true} is VALID [2022-04-07 18:32:24,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [116] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 18:32:24,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 18:32:24,395 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {43#false} is VALID [2022-04-07 18:32:24,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, 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] {43#false} is VALID [2022-04-07 18:32:24,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} [114] L30-3-->L52-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 18:32:24,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} [118] L52-2-->L38-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 18:32:24,397 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 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))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, 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] {43#false} is VALID [2022-04-07 18:32:24,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} [129] __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] {43#false} is VALID [2022-04-07 18:32:24,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} [132] 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[] {43#false} is VALID [2022-04-07 18:32:24,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 18:32:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:32:24,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:32:24,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721505342] [2022-04-07 18:32:24,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721505342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:32:24,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:32:24,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 18:32:24,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844538374] [2022-04-07 18:32:24,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:32:24,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 18:32:24,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:32:24,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:32:24,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:32:24,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 18:32:24,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:32:24,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 18:32:24,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 18:32:24,463 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:32:26,578 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-07 18:32:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:32:29,023 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-04-07 18:32:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 18:32:29,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 18:32:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:32:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:32:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-04-07 18:32:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:32:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-04-07 18:32:29,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2022-04-07 18:32:29,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:32:29,108 INFO L225 Difference]: With dead ends: 40 [2022-04-07 18:32:29,108 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 18:32:29,109 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 18:32:29,112 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-07 18:32:29,112 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-07 18:32:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 18:32:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-07 18:32:29,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:32:29,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 18:32:29,138 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 18:32:29,139 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 18:32:29,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:32:29,144 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-07 18:32:29,144 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-07 18:32:29,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:32:29,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:32:29,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-07 18:32:29,146 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-07 18:32:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:32:29,150 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-07 18:32:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-07 18:32:29,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:32:29,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:32:29,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:32:29,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:32:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 18:32:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-07 18:32:29,157 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-07 18:32:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:32:29,157 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-07 18:32:29,157 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:32:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-07 18:32:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 18:32:29,158 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:32:29,158 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:32:29,158 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 18:32:29,159 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:32:29,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:32:29,159 INFO L85 PathProgramCache]: Analyzing trace with hash -889932734, now seen corresponding path program 1 times [2022-04-07 18:32:29,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:32:29,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624395003] [2022-04-07 18:32:29,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:32:29,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:32:29,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:32:29,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936554480] [2022-04-07 18:32:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:32:29,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:32:29,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:32:29,179 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-07 18:32:29,190 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-07 18:32:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:29,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 18:32:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:29,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:32:29,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {198#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {198#true} is VALID [2022-04-07 18:32:29,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} [107] 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) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {206#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:29,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:29,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#(<= ~counter~0 0)} {198#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:29,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:29,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#(<= ~counter~0 0)} [109] mainENTRY-->L24: 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] {206#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:29,382 INFO L272 TraceCheckUtils]: 6: Hoare triple {206#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {206#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:29,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {206#(<= ~counter~0 0)} [113] 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] {206#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:29,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#(<= ~counter~0 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[] {206#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:29,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {206#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:29,385 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {206#(<= ~counter~0 0)} {206#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {206#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:29,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {206#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, 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] {206#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:29,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {206#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {240#(<= |main_#t~post5| 0)} is VALID [2022-04-07 18:32:29,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {240#(<= |main_#t~post5| 0)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {199#false} is VALID [2022-04-07 18:32:29,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {199#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {199#false} is VALID [2022-04-07 18:32:29,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {199#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {199#false} is VALID [2022-04-07 18:32:29,389 INFO L272 TraceCheckUtils]: 16: Hoare triple {199#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 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))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, 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] {199#false} is VALID [2022-04-07 18:32:29,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {199#false} [129] __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] {199#false} is VALID [2022-04-07 18:32:29,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {199#false} [132] 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[] {199#false} is VALID [2022-04-07 18:32:29,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {199#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {199#false} is VALID [2022-04-07 18:32:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:32:29,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 18:32:29,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:32:29,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624395003] [2022-04-07 18:32:29,394 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:32:29,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936554480] [2022-04-07 18:32:29,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936554480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:32:29,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:32:29,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 18:32:29,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627621436] [2022-04-07 18:32:29,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:32:29,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-07 18:32:29,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:32:29,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:32:29,415 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-07 18:32:29,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 18:32:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:32:29,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 18:32:29,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 18:32:29,417 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:32:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:32:38,522 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-07 18:32:38,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 18:32:38,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-07 18:32:38,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:32:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:32:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-04-07 18:32:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:32:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-04-07 18:32:38,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2022-04-07 18:32:38,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:32:38,578 INFO L225 Difference]: With dead ends: 36 [2022-04-07 18:32:38,578 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 18:32:38,578 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 18:32:38,579 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 18:32:38,580 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 18:32:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 18:32:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-07 18:32:38,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:32:38,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 18:32:38,585 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 18:32:38,585 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 18:32:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:32:38,588 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-07 18:32:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 18:32:38,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:32:38,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:32:38,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-07 18:32:38,590 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-07 18:32:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:32:38,597 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-07 18:32:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 18:32:38,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:32:38,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:32:38,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:32:38,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:32:38,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 18:32:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-07 18:32:38,601 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-07 18:32:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:32:38,601 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-07 18:32:38,601 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:32:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 18:32:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 18:32:38,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:32:38,602 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:32:38,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 18:32:38,825 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:32:38,825 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:32:38,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:32:38,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1699853977, now seen corresponding path program 1 times [2022-04-07 18:32:38,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:32:38,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738885083] [2022-04-07 18:32:38,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:32:38,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:32:38,845 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:32:38,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [207883154] [2022-04-07 18:32:38,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:32:38,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:32:38,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:32:38,851 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-07 18:32:38,853 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-07 18:32:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:38,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 18:32:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:38,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:32:39,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {405#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-07 18:32:39,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} [107] 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) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {413#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:39,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:39,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#(<= ~counter~0 0)} {405#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:39,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:39,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#(<= ~counter~0 0)} [109] mainENTRY-->L24: 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] {413#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:39,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {413#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {413#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:39,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {413#(<= ~counter~0 0)} [113] 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] {413#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:39,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {413#(<= ~counter~0 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[] {413#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:39,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {413#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:39,057 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {413#(<= ~counter~0 0)} {413#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {413#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:39,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {413#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, 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] {413#(<= ~counter~0 0)} is VALID [2022-04-07 18:32:39,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {413#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {447#(<= ~counter~0 1)} is VALID [2022-04-07 18:32:39,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {447#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {447#(<= ~counter~0 1)} is VALID [2022-04-07 18:32:39,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {447#(<= ~counter~0 1)} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {447#(<= ~counter~0 1)} is VALID [2022-04-07 18:32:39,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {447#(<= ~counter~0 1)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {457#(<= |main_#t~post6| 1)} is VALID [2022-04-07 18:32:39,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {457#(<= |main_#t~post6| 1)} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {406#false} is VALID [2022-04-07 18:32:39,061 INFO L272 TraceCheckUtils]: 17: Hoare triple {406#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 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))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, 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] {406#false} is VALID [2022-04-07 18:32:39,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {406#false} [129] __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] {406#false} is VALID [2022-04-07 18:32:39,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {406#false} [132] 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[] {406#false} is VALID [2022-04-07 18:32:39,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {406#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#false} is VALID [2022-04-07 18:32:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:32:39,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 18:32:39,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:32:39,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738885083] [2022-04-07 18:32:39,063 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:32:39,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207883154] [2022-04-07 18:32:39,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207883154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:32:39,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:32:39,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 18:32:39,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455299190] [2022-04-07 18:32:39,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:32:39,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-07 18:32:39,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:32:39,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:32:39,081 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-07 18:32:39,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:32:39,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:32:39,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:32:39,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:32:39,083 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:32:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:32:46,483 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 18:32:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 18:32:46,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-07 18:32:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:32:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:32:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-07 18:32:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:32:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-07 18:32:46,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-04-07 18:32:46,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:32:46,546 INFO L225 Difference]: With dead ends: 40 [2022-04-07 18:32:46,546 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 18:32:46,547 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:32:46,548 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 18:32:46,548 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 18:32:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 18:32:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-07 18:32:46,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:32:46,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 18:32:46,553 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 18:32:46,553 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 18:32:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:32:46,556 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 18:32:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-07 18:32:46,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:32:46,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:32:46,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-07 18:32:46,557 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-07 18:32:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:32:46,560 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 18:32:46,561 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-07 18:32:46,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:32:46,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:32:46,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:32:46,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:32:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 18:32:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-07 18:32:46,564 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-07 18:32:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:32:46,564 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-07 18:32:46,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:32:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-07 18:32:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 18:32:46,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:32:46,565 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:32:46,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 18:32:46,788 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 18:32:46,789 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:32:46,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:32:46,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1700986035, now seen corresponding path program 1 times [2022-04-07 18:32:46,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:32:46,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054786161] [2022-04-07 18:32:46,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:32:46,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:32:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:46,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 18:32:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:47,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {644#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {631#true} is VALID [2022-04-07 18:32:47,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {631#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {631#true} is VALID [2022-04-07 18:32:47,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {631#true} {631#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {631#true} is VALID [2022-04-07 18:32:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 18:32:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:32:47,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {631#true} [113] 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] {631#true} is VALID [2022-04-07 18:32:47,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {631#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[] {631#true} is VALID [2022-04-07 18:32:47,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {631#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {631#true} is VALID [2022-04-07 18:32:47,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {631#true} {631#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {631#true} is VALID [2022-04-07 18:32:47,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {631#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {644#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 18:32:47,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {631#true} is VALID [2022-04-07 18:32:47,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {631#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {631#true} is VALID [2022-04-07 18:32:47,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {631#true} {631#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {631#true} is VALID [2022-04-07 18:32:47,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {631#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {631#true} is VALID [2022-04-07 18:32:47,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {631#true} [109] mainENTRY-->L24: 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] {631#true} is VALID [2022-04-07 18:32:47,010 INFO L272 TraceCheckUtils]: 6: Hoare triple {631#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {631#true} is VALID [2022-04-07 18:32:47,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {631#true} [113] 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] {631#true} is VALID [2022-04-07 18:32:47,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {631#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[] {631#true} is VALID [2022-04-07 18:32:47,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {631#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {631#true} is VALID [2022-04-07 18:32:47,011 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {631#true} {631#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {631#true} is VALID [2022-04-07 18:32:47,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {631#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, 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] {640#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 18:32:47,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {640#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {640#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 18:32:47,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {640#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {640#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 18:32:47,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {640#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {641#(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-07 18:32:47,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {641#(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))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {641#(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-07 18:32:47,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {641#(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))} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {641#(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-07 18:32:47,017 INFO L272 TraceCheckUtils]: 17: Hoare triple {641#(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))} [130] 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] {642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 18:32:47,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {642#(not (= |__VERIFIER_assert_#in~cond| 0))} [129] __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] {643#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 18:32:47,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {643#(not (= __VERIFIER_assert_~cond 0))} [132] 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[] {632#false} is VALID [2022-04-07 18:32:47,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {632#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {632#false} is VALID [2022-04-07 18:32:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:32:47,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:32:47,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054786161] [2022-04-07 18:32:47,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054786161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:32:47,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:32:47,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 18:32:47,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228419585] [2022-04-07 18:32:47,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:32:47,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-07 18:32:47,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:32:47,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:32:47,062 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-07 18:32:47,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 18:32:47,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:32:47,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 18:32:47,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 18:32:47,063 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:32:50,642 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-07 18:32:55,654 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-07 18:32:57,661 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-07 18:33:00,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 18:33:02,634 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-07 18:33:04,563 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 18:33:08,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:08,627 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-07 18:33:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 18:33:08,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-07 18:33:08,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:33:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:33:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-04-07 18:33:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:33:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-04-07 18:33:08,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 75 transitions. [2022-04-07 18:33:08,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:08,846 INFO L225 Difference]: With dead ends: 53 [2022-04-07 18:33:08,846 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 18:33:08,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-07 18:33:08,847 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 37 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-04-07 18:33:08,848 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 205 Invalid, 4 Unknown, 0 Unchecked, 17.7s Time] [2022-04-07 18:33:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 18:33:08,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-07 18:33:08,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:33:08,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:33:08,853 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:33:08,853 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:33:08,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:08,856 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-07 18:33:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 18:33:08,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:08,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:08,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-07 18:33:08,858 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-07 18:33:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:08,861 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-07 18:33:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 18:33:08,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:08,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:08,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:33:08,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:33:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:33:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-07 18:33:08,865 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-07 18:33:08,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:33:08,865 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-07 18:33:08,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:33:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 18:33:08,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 18:33:08,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:33:08,866 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:33:08,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 18:33:08,867 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:33:08,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:33:08,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1908885951, now seen corresponding path program 1 times [2022-04-07 18:33:08,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:33:08,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593480810] [2022-04-07 18:33:08,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:08,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:33:08,888 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:33:08,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746656961] [2022-04-07 18:33:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:33:08,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:33:08,894 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-07 18:33:08,899 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-07 18:33:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:08,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 18:33:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:08,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:33:09,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {863#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {863#true} is VALID [2022-04-07 18:33:09,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {863#true} [107] 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) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {871#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {871#(<= ~counter~0 0)} {863#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {871#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {871#(<= ~counter~0 0)} [109] mainENTRY-->L24: 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] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,082 INFO L272 TraceCheckUtils]: 6: Hoare triple {871#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {871#(<= ~counter~0 0)} [113] 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] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {871#(<= ~counter~0 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[] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {871#(<= ~counter~0 0)} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,086 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {871#(<= ~counter~0 0)} {871#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {871#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, 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] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {871#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {905#(<= ~counter~0 1)} is VALID [2022-04-07 18:33:09,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {905#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {905#(<= ~counter~0 1)} is VALID [2022-04-07 18:33:09,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {905#(<= ~counter~0 1)} [127] L31-->L30-3: 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_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {905#(<= ~counter~0 1)} is VALID [2022-04-07 18:33:09,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {905#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {915#(<= |main_#t~post5| 1)} is VALID [2022-04-07 18:33:09,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {915#(<= |main_#t~post5| 1)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {864#false} is VALID [2022-04-07 18:33:09,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {864#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {864#false} is VALID [2022-04-07 18:33:09,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {864#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {864#false} is VALID [2022-04-07 18:33:09,093 INFO L272 TraceCheckUtils]: 19: Hoare triple {864#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 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))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, 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] {864#false} is VALID [2022-04-07 18:33:09,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {864#false} [129] __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] {864#false} is VALID [2022-04-07 18:33:09,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {864#false} [132] 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[] {864#false} is VALID [2022-04-07 18:33:09,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {864#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {864#false} is VALID [2022-04-07 18:33:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:33:09,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 18:33:09,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {864#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {864#false} is VALID [2022-04-07 18:33:09,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {864#false} [132] 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[] {864#false} is VALID [2022-04-07 18:33:09,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {864#false} [129] __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] {864#false} is VALID [2022-04-07 18:33:09,270 INFO L272 TraceCheckUtils]: 19: Hoare triple {864#false} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 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))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, 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] {864#false} is VALID [2022-04-07 18:33:09,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {864#false} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {864#false} is VALID [2022-04-07 18:33:09,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {864#false} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {864#false} is VALID [2022-04-07 18:33:09,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {915#(<= |main_#t~post5| 1)} [120] L30-1-->L52-2: Formula: (not (< |v_main_#t~post5_3| 2)) InVars {main_#t~post5=|v_main_#t~post5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {864#false} is VALID [2022-04-07 18:33:09,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {905#(<= ~counter~0 1)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {915#(<= |main_#t~post5| 1)} is VALID [2022-04-07 18:33:09,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {905#(<= ~counter~0 1)} [127] L31-->L30-3: 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_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {905#(<= ~counter~0 1)} is VALID [2022-04-07 18:33:09,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {905#(<= ~counter~0 1)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {905#(<= ~counter~0 1)} is VALID [2022-04-07 18:33:09,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {871#(<= ~counter~0 0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {905#(<= ~counter~0 1)} is VALID [2022-04-07 18:33:09,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {871#(<= ~counter~0 0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, 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] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,280 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {863#true} {871#(<= ~counter~0 0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {863#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {863#true} is VALID [2022-04-07 18:33:09,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {863#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[] {863#true} is VALID [2022-04-07 18:33:09,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {863#true} [113] 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] {863#true} is VALID [2022-04-07 18:33:09,281 INFO L272 TraceCheckUtils]: 6: Hoare triple {871#(<= ~counter~0 0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {863#true} is VALID [2022-04-07 18:33:09,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {871#(<= ~counter~0 0)} [109] mainENTRY-->L24: 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] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {871#(<= ~counter~0 0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {871#(<= ~counter~0 0)} {863#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {871#(<= ~counter~0 0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {863#true} [107] 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) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {871#(<= ~counter~0 0)} is VALID [2022-04-07 18:33:09,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {863#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {863#true} is VALID [2022-04-07 18:33:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:33:09,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:33:09,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593480810] [2022-04-07 18:33:09,284 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:33:09,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746656961] [2022-04-07 18:33:09,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746656961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 18:33:09,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 18:33:09,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-07 18:33:09,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233477372] [2022-04-07 18:33:09,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 18:33:09,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 18:33:09,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:33:09,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:33:09,306 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-07 18:33:09,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:33:09,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:33:09,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:33:09,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:33:09,307 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:33:14,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:14,545 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-07 18:33:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 18:33:14,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 18:33:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:33:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:33:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-07 18:33:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:33:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-07 18:33:14,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2022-04-07 18:33:14,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:14,601 INFO L225 Difference]: With dead ends: 53 [2022-04-07 18:33:14,601 INFO L226 Difference]: Without dead ends: 53 [2022-04-07 18:33:14,601 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-07 18:33:14,602 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 18:33:14,602 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 119 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 18:33:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-07 18:33:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-07 18:33:14,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:33:14,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:33:14,607 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:33:14,608 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:33:14,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:14,610 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-07 18:33:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2022-04-07 18:33:14,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:14,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:14,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 53 states. [2022-04-07 18:33:14,612 INFO L87 Difference]: Start difference. First operand has 53 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 53 states. [2022-04-07 18:33:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:14,615 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-07 18:33:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2022-04-07 18:33:14,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:14,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:14,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:33:14,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:33:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 18:33:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2022-04-07 18:33:14,618 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 23 [2022-04-07 18:33:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:33:14,618 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2022-04-07 18:33:14,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:33:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2022-04-07 18:33:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 18:33:14,619 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:33:14,619 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:33:14,636 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-07 18:33:14,827 WARN L460 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-07 18:33:14,827 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:33:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:33:14,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1731080004, now seen corresponding path program 1 times [2022-04-07 18:33:14,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:33:14,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834896952] [2022-04-07 18:33:14,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:14,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:33:14,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:33:14,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818108279] [2022-04-07 18:33:14,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:14,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:33:14,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:33:14,843 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-07 18:33:14,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 18:33:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:14,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 18:33:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:14,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:33:15,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {1219#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1219#true} is VALID [2022-04-07 18:33:15,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {1219#true} [107] 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) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1219#true} is VALID [2022-04-07 18:33:15,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1219#true} is VALID [2022-04-07 18:33:15,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1219#true} {1219#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1219#true} is VALID [2022-04-07 18:33:15,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {1219#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1219#true} is VALID [2022-04-07 18:33:15,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {1219#true} [109] mainENTRY-->L24: 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] {1219#true} is VALID [2022-04-07 18:33:15,052 INFO L272 TraceCheckUtils]: 6: Hoare triple {1219#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {1219#true} is VALID [2022-04-07 18:33:15,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {1219#true} [113] 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] {1219#true} is VALID [2022-04-07 18:33:15,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {1219#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[] {1219#true} is VALID [2022-04-07 18:33:15,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {1219#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1219#true} is VALID [2022-04-07 18:33:15,053 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1219#true} {1219#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {1219#true} is VALID [2022-04-07 18:33:15,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {1219#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, 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] {1257#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:15,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {1257#(and (= main_~p~0 0) (= main_~h~0 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1257#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:15,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {1257#(and (= main_~p~0 0) (= main_~h~0 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1257#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:15,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {1257#(and (= main_~p~0 0) (= main_~h~0 0))} [127] L31-->L30-3: 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_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1257#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:15,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {1257#(and (= main_~p~0 0) (= main_~h~0 0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1257#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:15,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {1257#(and (= main_~p~0 0) (= main_~h~0 0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1257#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:15,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {1257#(and (= main_~p~0 0) (= main_~h~0 0))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1257#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:15,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {1257#(and (= main_~p~0 0) (= main_~h~0 0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1257#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:15,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {1257#(and (= main_~p~0 0) (= main_~h~0 0))} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1257#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 18:33:15,057 INFO L272 TraceCheckUtils]: 20: Hoare triple {1257#(and (= main_~p~0 0) (= main_~h~0 0))} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 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))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, 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] {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:33:15,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {1285#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __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] {1289#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:33:15,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {1289#(<= 1 __VERIFIER_assert_~cond)} [132] 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[] {1220#false} is VALID [2022-04-07 18:33:15,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {1220#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#false} is VALID [2022-04-07 18:33:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 18:33:15,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 18:33:15,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:33:15,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834896952] [2022-04-07 18:33:15,059 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:33:15,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818108279] [2022-04-07 18:33:15,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818108279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:33:15,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:33:15,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 18:33:15,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627851562] [2022-04-07 18:33:15,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:33:15,060 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-07 18:33:15,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:33:15,060 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:33:15,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:15,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:33:15,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:33:15,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:33:15,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:33:15,082 INFO L87 Difference]: Start difference. First operand 53 states and 71 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:33:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:27,964 INFO L93 Difference]: Finished difference Result 73 states and 99 transitions. [2022-04-07 18:33:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 18:33:27,964 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-07 18:33:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:33:27,965 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:33:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-07 18:33:27,967 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:33:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-07 18:33:27,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-07 18:33:28,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:28,050 INFO L225 Difference]: With dead ends: 73 [2022-04-07 18:33:28,050 INFO L226 Difference]: Without dead ends: 54 [2022-04-07 18:33:28,050 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-07 18:33:28,051 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-07 18:33:28,051 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 157 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-07 18:33:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-07 18:33:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-07 18:33:28,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:33:28,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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-07 18:33:28,056 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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-07 18:33:28,056 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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-07 18:33:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:28,059 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2022-04-07 18:33:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2022-04-07 18:33:28,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:28,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:28,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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 54 states. [2022-04-07 18:33:28,060 INFO L87 Difference]: Start difference. First operand has 54 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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 54 states. [2022-04-07 18:33:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:28,062 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2022-04-07 18:33:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2022-04-07 18:33:28,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:28,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:28,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:33:28,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:33:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 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-07 18:33:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2022-04-07 18:33:28,066 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 24 [2022-04-07 18:33:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:33:28,066 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2022-04-07 18:33:28,066 INFO L479 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 18:33:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2022-04-07 18:33:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 18:33:28,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:33:28,067 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:33:28,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 18:33:28,270 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:33:28,271 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:33:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:33:28,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1729947946, now seen corresponding path program 1 times [2022-04-07 18:33:28,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:33:28,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965358896] [2022-04-07 18:33:28,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:28,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:33:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 18:33:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:28,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {1545#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1537#(<= 0 ~counter~0)} is VALID [2022-04-07 18:33:28,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {1537#(<= 0 ~counter~0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1537#(<= 0 ~counter~0)} is VALID [2022-04-07 18:33:28,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1537#(<= 0 ~counter~0)} {1532#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1537#(<= 0 ~counter~0)} is VALID [2022-04-07 18:33:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 18:33:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:28,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {1532#true} [113] 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] {1532#true} is VALID [2022-04-07 18:33:28,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {1532#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[] {1532#true} is VALID [2022-04-07 18:33:28,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {1532#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1532#true} is VALID [2022-04-07 18:33:28,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1532#true} {1537#(<= 0 ~counter~0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {1537#(<= 0 ~counter~0)} is VALID [2022-04-07 18:33:28,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {1532#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1545#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 18:33:28,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {1545#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [107] 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) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1537#(<= 0 ~counter~0)} is VALID [2022-04-07 18:33:28,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {1537#(<= 0 ~counter~0)} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1537#(<= 0 ~counter~0)} is VALID [2022-04-07 18:33:28,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1537#(<= 0 ~counter~0)} {1532#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1537#(<= 0 ~counter~0)} is VALID [2022-04-07 18:33:28,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {1537#(<= 0 ~counter~0)} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1537#(<= 0 ~counter~0)} is VALID [2022-04-07 18:33:28,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {1537#(<= 0 ~counter~0)} [109] mainENTRY-->L24: 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] {1537#(<= 0 ~counter~0)} is VALID [2022-04-07 18:33:28,386 INFO L272 TraceCheckUtils]: 6: Hoare triple {1537#(<= 0 ~counter~0)} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {1532#true} is VALID [2022-04-07 18:33:28,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {1532#true} [113] 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] {1532#true} is VALID [2022-04-07 18:33:28,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {1532#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[] {1532#true} is VALID [2022-04-07 18:33:28,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {1532#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1532#true} is VALID [2022-04-07 18:33:28,387 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1532#true} {1537#(<= 0 ~counter~0)} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {1537#(<= 0 ~counter~0)} is VALID [2022-04-07 18:33:28,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {1537#(<= 0 ~counter~0)} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, 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] {1537#(<= 0 ~counter~0)} is VALID [2022-04-07 18:33:28,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {1537#(<= 0 ~counter~0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1542#(<= 1 ~counter~0)} is VALID [2022-04-07 18:33:28,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(<= 1 ~counter~0)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1542#(<= 1 ~counter~0)} is VALID [2022-04-07 18:33:28,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {1542#(<= 1 ~counter~0)} [127] L31-->L30-3: 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_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1542#(<= 1 ~counter~0)} is VALID [2022-04-07 18:33:28,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {1542#(<= 1 ~counter~0)} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1543#(<= 2 ~counter~0)} is VALID [2022-04-07 18:33:28,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {1543#(<= 2 ~counter~0)} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1543#(<= 2 ~counter~0)} is VALID [2022-04-07 18:33:28,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {1543#(<= 2 ~counter~0)} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1543#(<= 2 ~counter~0)} is VALID [2022-04-07 18:33:28,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {1543#(<= 2 ~counter~0)} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1544#(<= 2 |main_#t~post6|)} is VALID [2022-04-07 18:33:28,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {1544#(<= 2 |main_#t~post6|)} [125] L38-->L39: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1533#false} is VALID [2022-04-07 18:33:28,391 INFO L272 TraceCheckUtils]: 20: Hoare triple {1533#false} [130] 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] {1533#false} is VALID [2022-04-07 18:33:28,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {1533#false} [129] __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] {1533#false} is VALID [2022-04-07 18:33:28,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {1533#false} [132] 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[] {1533#false} is VALID [2022-04-07 18:33:28,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {1533#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1533#false} is VALID [2022-04-07 18:33:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 18:33:28,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:33:28,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965358896] [2022-04-07 18:33:28,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965358896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:33:28,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:33:28,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 18:33:28,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96342009] [2022-04-07 18:33:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:33:28,395 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-07 18:33:28,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:33:28,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:33:28,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:28,411 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 18:33:28,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:33:28,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 18:33:28,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-07 18:33:28,412 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:33:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:28,703 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-04-07 18:33:28,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 18:33:28,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-07 18:33:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:33:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:33:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-07 18:33:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:33:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-04-07 18:33:28,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-04-07 18:33:28,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:28,735 INFO L225 Difference]: With dead ends: 34 [2022-04-07 18:33:28,735 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 18:33:28,735 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-07 18:33:28,736 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 18:33:28,736 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 43 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 18:33:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 18:33:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-07 18:33:28,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:33:28,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 18:33:28,738 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 18:33:28,738 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 18:33:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:28,739 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-07 18:33:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-07 18:33:28,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:28,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:28,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-07 18:33:28,740 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-07 18:33:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:28,741 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-07 18:33:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-07 18:33:28,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:28,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:28,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:33:28,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:33:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 18:33:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-04-07 18:33:28,742 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 24 [2022-04-07 18:33:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:33:28,742 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-04-07 18:33:28,742 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 18:33:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-07 18:33:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 18:33:28,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 18:33:28,745 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:33:28,745 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 18:33:28,745 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 18:33:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 18:33:28,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1279154140, now seen corresponding path program 1 times [2022-04-07 18:33:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 18:33:28,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933270983] [2022-04-07 18:33:28,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:28,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 18:33:28,771 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 18:33:28,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1600353679] [2022-04-07 18:33:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 18:33:28,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:33:28,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 18:33:28,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 18:33:28,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 18:33:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:28,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 18:33:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 18:33:28,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 18:33:29,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {1685#true} [105] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1685#true} is VALID [2022-04-07 18:33:29,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {1685#true} [107] 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) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~counter~0, #NULL.offset, #NULL.base] {1685#true} is VALID [2022-04-07 18:33:29,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {1685#true} [110] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1685#true} is VALID [2022-04-07 18:33:29,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} [148] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1685#true} is VALID [2022-04-07 18:33:29,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {1685#true} [106] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1685#true} is VALID [2022-04-07 18:33:29,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {1685#true} [109] mainENTRY-->L24: 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] {1685#true} is VALID [2022-04-07 18:33:29,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {1685#true} [111] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {1685#true} is VALID [2022-04-07 18:33:29,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {1685#true} [113] 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] {1685#true} is VALID [2022-04-07 18:33:29,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {1685#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[] {1685#true} is VALID [2022-04-07 18:33:29,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {1685#true} [122] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1685#true} is VALID [2022-04-07 18:33:29,016 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1685#true} {1685#true} [149] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (< (mod v_main_~n~0_16 4294967296) 1073741823) 1 0)) InVars {main_~n~0=v_main_~n~0_16} 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] {1685#true} is VALID [2022-04-07 18:33:29,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {1685#true} [112] L24-1-->L30-3: Formula: (and (= v_main_~p~0_2 0) (= v_main_~q~0_2 1) (= v_main_~n~0_5 v_main_~r~0_2) (= v_main_~h~0_2 0)) InVars {main_~n~0=v_main_~n~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~n~0=v_main_~n~0_5, 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] {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:29,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:29,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:29,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [127] L31-->L30-3: 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_7 4294967296))) InVars {main_~q~0=v_main_~q~0_5, main_~n~0=v_main_~n~0_7} OutVars{main_~q~0=v_main_~q~0_4, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~q~0] {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:29,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [115] L30-3-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:29,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [121] L30-1-->L31: Formula: (< |v_main_#t~post5_5| 2) InVars {main_#t~post5=|v_main_#t~post5_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post5] {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:29,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [126] L31-->L52-2: Formula: (not (<= (mod v_main_~q~0_3 4294967296) (mod v_main_~n~0_6 4294967296))) InVars {main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} OutVars{main_~q~0=v_main_~q~0_3, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:29,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [119] L52-2-->L38: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_4) (= v_~counter~0_3 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:29,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [124] L38-->L38-2: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:29,022 INFO L272 TraceCheckUtils]: 20: Hoare triple {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [123] L38-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 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))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, 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] {1685#true} is VALID [2022-04-07 18:33:29,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#true} [129] __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] {1685#true} is VALID [2022-04-07 18:33:29,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {1685#true} [133] 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[] {1685#true} is VALID [2022-04-07 18:33:29,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {1685#true} [138] L12-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1685#true} is VALID [2022-04-07 18:33:29,023 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1685#true} {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [156] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (mod (let ((.cse0 (* v_main_~h~0_14 12))) (+ (* (* v_main_~n~0_22 .cse0) 4294967295) (* (* v_main_~n~0_22 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))) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~n~0=v_main_~n~0_22, 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] {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 18:33:29,024 INFO L272 TraceCheckUtils]: 25: Hoare triple {1723#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} [128] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ v_main_~r~0_22 (* v_main_~p~0_23 v_main_~p~0_23) (* v_main_~n~0_23 4294967295)) 4294967296) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_8|) InVars {main_~n~0=v_main_~n~0_23, main_~p~0=v_main_~p~0_23, main_~r~0=v_main_~r~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~n~0, main_~p~0, main_~r~0] {1766#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 18:33:29,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {1766#(<= 1 |__VERIFIER_assert_#in~cond|)} [129] __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] {1770#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 18:33:29,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {1770#(<= 1 __VERIFIER_assert_~cond)} [132] 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[] {1686#false} is VALID [2022-04-07 18:33:29,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {1686#false} [136] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1686#false} is VALID [2022-04-07 18:33:29,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-07 18:33:29,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 18:33:29,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 18:33:29,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933270983] [2022-04-07 18:33:29,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 18:33:29,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600353679] [2022-04-07 18:33:29,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600353679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 18:33:29,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 18:33:29,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 18:33:29,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047220574] [2022-04-07 18:33:29,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 18:33:29,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-07 18:33:29,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 18:33:29,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:33:29,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:29,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 18:33:29,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 18:33:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 18:33:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 18:33:29,050 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:33:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:29,152 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-07 18:33:29,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 18:33:29,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-07 18:33:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 18:33:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:33:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-07 18:33:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:33:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-07 18:33:29,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-07 18:33:29,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 18:33:29,176 INFO L225 Difference]: With dead ends: 30 [2022-04-07 18:33:29,177 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 18:33:29,177 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-07 18:33:29,177 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 18:33:29,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 18:33:29,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 18:33:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 18:33:29,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 18:33:29,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 18:33:29,178 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 18:33:29,178 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 18:33:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:29,179 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 18:33:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 18:33:29,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:29,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:29,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 18:33:29,179 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 18:33:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 18:33:29,179 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 18:33:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 18:33:29,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:29,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 18:33:29,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 18:33:29,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 18:33:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 18:33:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 18:33:29,180 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-07 18:33:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 18:33:29,180 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 18:33:29,180 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 18:33:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 18:33:29,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 18:33:29,183 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 18:33:29,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 18:33:29,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 18:33:29,402 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 18:33:29,403 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 18:33:29,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 06:33:29 BasicIcfg [2022-04-07 18:33:29,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 18:33:29,406 INFO L158 Benchmark]: Toolchain (without parser) took 66099.33ms. Allocated memory is still 181.4MB. Free memory was 133.1MB in the beginning and 116.7MB in the end (delta: 16.5MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB. [2022-04-07 18:33:29,407 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory was 149.8MB in the beginning and 149.7MB in the end (delta: 83.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 18:33:29,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.96ms. Allocated memory is still 181.4MB. Free memory was 133.0MB in the beginning and 157.6MB in the end (delta: -24.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 18:33:29,407 INFO L158 Benchmark]: Boogie Preprocessor took 35.31ms. Allocated memory is still 181.4MB. Free memory was 157.6MB in the beginning and 156.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 18:33:29,407 INFO L158 Benchmark]: RCFGBuilder took 367.12ms. Allocated memory is still 181.4MB. Free memory was 156.0MB in the beginning and 142.6MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-07 18:33:29,408 INFO L158 Benchmark]: IcfgTransformer took 64.02ms. Allocated memory is still 181.4MB. Free memory was 142.6MB in the beginning and 140.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 18:33:29,408 INFO L158 Benchmark]: TraceAbstraction took 65312.11ms. Allocated memory is still 181.4MB. Free memory was 139.8MB in the beginning and 116.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. [2022-04-07 18:33:29,409 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory was 149.8MB in the beginning and 149.7MB in the end (delta: 83.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 314.96ms. Allocated memory is still 181.4MB. Free memory was 133.0MB in the beginning and 157.6MB in the end (delta: -24.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.31ms. Allocated memory is still 181.4MB. Free memory was 157.6MB in the beginning and 156.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 367.12ms. Allocated memory is still 181.4MB. Free memory was 156.0MB in the beginning and 142.6MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 64.02ms. Allocated memory is still 181.4MB. Free memory was 142.6MB in the beginning and 140.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 65312.11ms. Allocated memory is still 181.4MB. Free memory was 139.8MB in the beginning and 116.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 61.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 21.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 792 SdHoareTripleChecker+Invalid, 21.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 466 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 379 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 326 mSDtfsCounter, 379 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=6, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 594 SizeOfPredicates, 7 NumberOfNonLiveVariables, 461 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 11/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 18:33:29,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...