/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/lcm1_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 22:17:06,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 22:17:06,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 22:17:06,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 22:17:06,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 22:17:06,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 22:17:06,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 22:17:06,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 22:17:06,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 22:17:06,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 22:17:06,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 22:17:06,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 22:17:06,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 22:17:06,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 22:17:06,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 22:17:06,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 22:17:06,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 22:17:06,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 22:17:06,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 22:17:06,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 22:17:06,458 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 22:17:06,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 22:17:06,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 22:17:06,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 22:17:06,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 22:17:06,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 22:17:06,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 22:17:06,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 22:17:06,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 22:17:06,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 22:17:06,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 22:17:06,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 22:17:06,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 22:17:06,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 22:17:06,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 22:17:06,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 22:17:06,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 22:17:06,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 22:17:06,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 22:17:06,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 22:17:06,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 22:17:06,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 22:17:06,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 22:17:06,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 22:17:06,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 22:17:06,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 22:17:06,474 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 22:17:06,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 22:17:06,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 22:17:06,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 22:17:06,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 22:17:06,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 22:17:06,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 22:17:06,474 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 22:17:06,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 22:17:06,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 22:17:06,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 22:17:06,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 22:17:06,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 22:17:06,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 22:17:06,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 22:17:06,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 22:17:06,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 22:17:06,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 22:17:06,476 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 22:17:06,476 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 22:17:06,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 22:17:06,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 22:17:06,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 22:17:06,659 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 22:17:06,660 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 22:17:06,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm1_valuebound100.c [2022-04-14 22:17:06,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e2830a2/2074625fe94e44569b66fb07692c3882/FLAG9d34d6a38 [2022-04-14 22:17:07,054 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 22:17:07,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm1_valuebound100.c [2022-04-14 22:17:07,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e2830a2/2074625fe94e44569b66fb07692c3882/FLAG9d34d6a38 [2022-04-14 22:17:07,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95e2830a2/2074625fe94e44569b66fb07692c3882 [2022-04-14 22:17:07,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 22:17:07,488 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 22:17:07,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 22:17:07,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 22:17:07,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 22:17:07,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:17:07" (1/1) ... [2022-04-14 22:17:07,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@298b0837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:17:07, skipping insertion in model container [2022-04-14 22:17:07,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:17:07" (1/1) ... [2022-04-14 22:17:07,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 22:17:07,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 22:17:07,616 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/lcm1_valuebound100.c[552,565] [2022-04-14 22:17:07,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 22:17:07,636 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 22:17:07,644 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/lcm1_valuebound100.c[552,565] [2022-04-14 22:17:07,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 22:17:07,658 INFO L208 MainTranslator]: Completed translation [2022-04-14 22:17:07,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:17:07 WrapperNode [2022-04-14 22:17:07,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 22:17:07,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 22:17:07,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 22:17:07,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 22:17:07,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:17:07" (1/1) ... [2022-04-14 22:17:07,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:17:07" (1/1) ... [2022-04-14 22:17:07,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:17:07" (1/1) ... [2022-04-14 22:17:07,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:17:07" (1/1) ... [2022-04-14 22:17:07,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:17:07" (1/1) ... [2022-04-14 22:17:07,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:17:07" (1/1) ... [2022-04-14 22:17:07,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:17:07" (1/1) ... [2022-04-14 22:17:07,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 22:17:07,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 22:17:07,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 22:17:07,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 22:17:07,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:17:07" (1/1) ... [2022-04-14 22:17:07,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 22:17:07,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 22:17:07,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 22:17:07,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 22:17:07,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 22:17:07,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 22:17:07,722 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 22:17:07,722 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 22:17:07,722 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 22:17:07,723 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 22:17:07,723 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 22:17:07,723 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 22:17:07,723 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 22:17:07,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 22:17:07,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 22:17:07,723 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 22:17:07,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 22:17:07,723 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 22:17:07,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 22:17:07,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 22:17:07,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 22:17:07,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 22:17:07,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 22:17:07,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 22:17:07,764 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 22:17:07,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 22:17:07,913 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 22:17:07,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 22:17:07,918 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-14 22:17:07,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:17:07 BoogieIcfgContainer [2022-04-14 22:17:07,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 22:17:07,920 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 22:17:07,920 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 22:17:07,920 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 22:17:07,922 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:17:07" (1/1) ... [2022-04-14 22:17:07,924 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 22:17:07,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 10:17:07 BasicIcfg [2022-04-14 22:17:07,955 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 22:17:07,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 22:17:07,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 22:17:07,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 22:17:07,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 10:17:07" (1/4) ... [2022-04-14 22:17:07,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7fc972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:17:07, skipping insertion in model container [2022-04-14 22:17:07,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:17:07" (2/4) ... [2022-04-14 22:17:07,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7fc972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:17:07, skipping insertion in model container [2022-04-14 22:17:07,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:17:07" (3/4) ... [2022-04-14 22:17:07,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7fc972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 10:17:07, skipping insertion in model container [2022-04-14 22:17:07,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 10:17:07" (4/4) ... [2022-04-14 22:17:07,960 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm1_valuebound100.cJordan [2022-04-14 22:17:07,964 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 22:17:07,964 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 22:17:07,992 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 22:17:07,997 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 22:17:07,997 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 22:17:08,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 22:17:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 22:17:08,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 22:17:08,014 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 22:17:08,015 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 22:17:08,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 22:17:08,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2059041159, now seen corresponding path program 1 times [2022-04-14 22:17:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 22:17:08,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69033478] [2022-04-14 22:17:08,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:17:08,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 22:17:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:17:08,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 22:17:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:17:08,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse1 (select |v_#memory_int_1| 1)) (.cse0 (select |v_#memory_int_1| 2))) (and (= 49 (select .cse0 3)) (= 48 (select .cse1 0)) (= 108 (select .cse0 0)) (= (select .cse0 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse0 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse0 2) 109) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse1 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse0 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse0 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {43#true} is VALID [2022-04-14 22:17:08,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-14 22:17:08,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} [164] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-14 22:17:08,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 22:17:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:17:08,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-14 22:17:08,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [128] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} [165] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~a~0_12 4294967296) 100) 1 0)) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {44#false} is VALID [2022-04-14 22:17:08,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-14 22:17:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:17:08,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-14 22:17:08,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [128] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} [166] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_11 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-14 22:17:08,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 22:17:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:17:08,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-14 22:17:08,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [128] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} [167] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_13 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {44#false} is VALID [2022-04-14 22:17:08,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-14 22:17:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:17:08,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-14 22:17:08,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [128] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} [168] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~b~0_12 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-14 22:17:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-14 22:17:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:17:08,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-14 22:17:08,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [128] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} [169] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~a~0_14 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {44#false} is VALID [2022-04-14 22:17:08,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-14 22:17:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:17:08,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-14 22:17:08,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [128] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} [170] assume_abort_if_notEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_13 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-14 22:17:08,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 22:17:08,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse1 (select |v_#memory_int_1| 1)) (.cse0 (select |v_#memory_int_1| 2))) (and (= 49 (select .cse0 3)) (= 48 (select .cse1 0)) (= 108 (select .cse0 0)) (= (select .cse0 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse0 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse0 2) 109) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse1 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse0 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse0 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {43#true} is VALID [2022-04-14 22:17:08,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-14 22:17:08,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} [164] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-14 22:17:08,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-14 22:17:08,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} [122] mainENTRY-->L26: Formula: (= v_main_~a~0_2 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_3, main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_4, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {43#true} is VALID [2022-04-14 22:17:08,187 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} [124] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~a~0_12 4294967296) 100) 1 0)) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {43#true} is VALID [2022-04-14 22:17:08,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-14 22:17:08,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} [128] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,188 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} [165] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~a~0_12 4294967296) 100) 1 0)) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {44#false} is VALID [2022-04-14 22:17:08,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#false} [125] L26-1-->L28: Formula: (= v_main_~b~0_3 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~b~0] {44#false} is VALID [2022-04-14 22:17:08,188 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} [127] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_11 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {43#true} is VALID [2022-04-14 22:17:08,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-14 22:17:08,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} [128] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,189 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} [166] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_11 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-14 22:17:08,189 INFO L272 TraceCheckUtils]: 17: Hoare triple {44#false} [130] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_13 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {43#true} is VALID [2022-04-14 22:17:08,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-14 22:17:08,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} [128] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,190 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} [167] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_13 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {44#false} is VALID [2022-04-14 22:17:08,190 INFO L272 TraceCheckUtils]: 22: Hoare triple {44#false} [132] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~b~0_12 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {43#true} is VALID [2022-04-14 22:17:08,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-14 22:17:08,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} [128] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,191 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} [168] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~b~0_12 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-14 22:17:08,192 INFO L272 TraceCheckUtils]: 27: Hoare triple {44#false} [133] L30-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~a~0_14 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {43#true} is VALID [2022-04-14 22:17:08,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {43#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-14 22:17:08,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#true} [128] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {44#false} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,193 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {44#false} {44#false} [169] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~a~0_14 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {44#false} is VALID [2022-04-14 22:17:08,193 INFO L272 TraceCheckUtils]: 32: Hoare triple {44#false} [134] L32-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_13 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {43#true} is VALID [2022-04-14 22:17:08,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {43#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {43#true} is VALID [2022-04-14 22:17:08,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {43#true} [128] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {44#false} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,194 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {44#false} {44#false} [170] assume_abort_if_notEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_13 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-14 22:17:08,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {44#false} [135] L33-->L53-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_5) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~v~0_4 0) (= v_main_~a~0_8 v_main_~x~0_4)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_8} OutVars{main_~v~0=v_main_~v~0_4, main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {44#false} is VALID [2022-04-14 22:17:08,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {44#false} [136] L53-2-->L40-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,194 INFO L272 TraceCheckUtils]: 39: Hoare triple {44#false} [139] L40-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ (* v_main_~v~0_13 v_main_~y~0_18) (* v_main_~u~0_13 v_main_~y~0_18)) 4294967296) (mod (* v_main_~a~0_18 v_main_~b~0_17) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~y~0=v_main_~y~0_18, main_~v~0=v_main_~v~0_13, main_~b~0=v_main_~b~0_17, main_~u~0=v_main_~u~0_13, main_~a~0=v_main_~a~0_18} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {44#false} is VALID [2022-04-14 22:17:08,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {44#false} [142] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {44#false} is VALID [2022-04-14 22:17:08,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {44#false} [146] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,195 INFO L290 TraceCheckUtils]: 42: Hoare triple {44#false} [152] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-14 22:17:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 22:17:08,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 22:17:08,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69033478] [2022-04-14 22:17:08,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69033478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 22:17:08,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 22:17:08,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 22:17:08,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494274189] [2022-04-14 22:17:08,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 22:17:08,201 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-14 22:17:08,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 22:17:08,205 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:17:08,236 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-14 22:17:08,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 22:17:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 22:17:08,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 22:17:08,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 22:17:08,260 INFO L87 Difference]: Start difference. First operand has 40 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:17:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:17:08,401 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-14 22:17:08,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 22:17:08,402 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-14 22:17:08,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 22:17:08,403 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:17:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-04-14 22:17:08,411 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:17:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-04-14 22:17:08,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 59 transitions. [2022-04-14 22:17:08,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:17:08,482 INFO L225 Difference]: With dead ends: 40 [2022-04-14 22:17:08,482 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 22:17:08,484 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 22:17:08,489 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 22:17:08,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 22:17:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 22:17:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-14 22:17:08,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 22:17:08,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 22:17:08,511 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 22:17:08,512 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 22:17:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:17:08,521 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-14 22:17:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-14 22:17:08,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:17:08,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:17:08,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 35 states. [2022-04-14 22:17:08,524 INFO L87 Difference]: Start difference. First operand has 35 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 35 states. [2022-04-14 22:17:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:17:08,537 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-14 22:17:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-14 22:17:08,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:17:08,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:17:08,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 22:17:08,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 22:17:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 22:17:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-04-14 22:17:08,541 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 43 [2022-04-14 22:17:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 22:17:08,541 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-04-14 22:17:08,541 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 22:17:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-14 22:17:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 22:17:08,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 22:17:08,542 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 22:17:08,543 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 22:17:08,543 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 22:17:08,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 22:17:08,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1255008874, now seen corresponding path program 1 times [2022-04-14 22:17:08,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 22:17:08,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875913587] [2022-04-14 22:17:08,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:17:08,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 22:17:08,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 22:17:08,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [385642867] [2022-04-14 22:17:08,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:17:08,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 22:17:08,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 22:17:08,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 22:17:08,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 22:17:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:17:08,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 22:17:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 22:17:08,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 22:17:08,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {220#true} [118] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#true} [120] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse1 (select |v_#memory_int_1| 1)) (.cse0 (select |v_#memory_int_1| 2))) (and (= 49 (select .cse0 3)) (= 48 (select .cse1 0)) (= 108 (select .cse0 0)) (= (select .cse0 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse0 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse0 2) 109) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse1 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse0 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse0 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {220#true} is VALID [2022-04-14 22:17:08,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {220#true} [123] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} [164] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {220#true} [119] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#true} [122] mainENTRY-->L26: Formula: (= v_main_~a~0_2 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_3, main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_4, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {220#true} is VALID [2022-04-14 22:17:08,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {220#true} [124] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~a~0_12 4294967296) 100) 1 0)) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {220#true} is VALID [2022-04-14 22:17:08,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {220#true} is VALID [2022-04-14 22:17:08,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#true} [129] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#true} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {220#true} {220#true} [165] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~a~0_12 4294967296) 100) 1 0)) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {220#true} is VALID [2022-04-14 22:17:08,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {220#true} [125] L26-1-->L28: Formula: (= v_main_~b~0_3 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~b~0] {220#true} is VALID [2022-04-14 22:17:08,899 INFO L272 TraceCheckUtils]: 12: Hoare triple {220#true} [127] L28-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_11 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {220#true} is VALID [2022-04-14 22:17:08,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {220#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {220#true} is VALID [2022-04-14 22:17:08,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {220#true} [129] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {220#true} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,901 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {220#true} {220#true} [166] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_11 4294967296) 100) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {220#true} is VALID [2022-04-14 22:17:08,901 INFO L272 TraceCheckUtils]: 17: Hoare triple {220#true} [130] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_13 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {220#true} is VALID [2022-04-14 22:17:08,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {220#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {220#true} is VALID [2022-04-14 22:17:08,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {220#true} [129] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {220#true} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,903 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {220#true} {220#true} [167] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_13 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {220#true} is VALID [2022-04-14 22:17:08,903 INFO L272 TraceCheckUtils]: 22: Hoare triple {220#true} [132] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 (mod v_main_~b~0_12 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {220#true} is VALID [2022-04-14 22:17:08,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {220#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {220#true} is VALID [2022-04-14 22:17:08,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {220#true} [129] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {220#true} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,905 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {220#true} {220#true} [168] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 (mod v_main_~b~0_12 4294967296)) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {220#true} is VALID [2022-04-14 22:17:08,905 INFO L272 TraceCheckUtils]: 27: Hoare triple {220#true} [133] L30-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~a~0_14 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {220#true} is VALID [2022-04-14 22:17:08,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {220#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {220#true} is VALID [2022-04-14 22:17:08,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {220#true} [129] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {220#true} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,908 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {220#true} {220#true} [169] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~a~0_14 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_14} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {220#true} is VALID [2022-04-14 22:17:08,908 INFO L272 TraceCheckUtils]: 32: Hoare triple {220#true} [134] L32-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_13 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {220#true} is VALID [2022-04-14 22:17:08,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {220#true} [126] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {220#true} is VALID [2022-04-14 22:17:08,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {220#true} [129] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {220#true} [131] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#true} is VALID [2022-04-14 22:17:08,909 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {220#true} {220#true} [170] assume_abort_if_notEXIT-->L33: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_13 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_13} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {220#true} is VALID [2022-04-14 22:17:08,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {220#true} [135] L33-->L53-2: Formula: (and (= v_main_~b~0_7 v_main_~u~0_5) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~v~0_4 0) (= v_main_~a~0_8 v_main_~x~0_4)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_8} OutVars{main_~v~0=v_main_~v~0_4, main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {336#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 22:17:08,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {336#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [138] L53-2-->L41: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 22:17:08,913 INFO L272 TraceCheckUtils]: 39: Hoare triple {336#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [140] L41-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~a~0_15 v_main_~b~0_14) 4294967296) (mod (+ (* v_main_~v~0_10 v_main_~y~0_15) (* v_main_~u~0_10 v_main_~x~0_14)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~x~0=v_main_~x~0_14, main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_14, main_~u~0=v_main_~u~0_10, main_~a~0=v_main_~a~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {343#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 22:17:08,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {343#(<= 1 |__VERIFIER_assert_#in~cond|)} [142] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {347#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 22:17:08,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {347#(<= 1 __VERIFIER_assert_~cond)} [146] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {221#false} is VALID [2022-04-14 22:17:08,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {221#false} [152] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {221#false} is VALID [2022-04-14 22:17:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-14 22:17:08,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 22:17:08,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 22:17:08,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875913587] [2022-04-14 22:17:08,917 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 22:17:08,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385642867] [2022-04-14 22:17:08,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385642867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 22:17:08,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 22:17:08,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 22:17:08,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125353736] [2022-04-14 22:17:08,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 22:17:08,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-14 22:17:08,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 22:17:08,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 22:17:08,944 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-14 22:17:08,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 22:17:08,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 22:17:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 22:17:08,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 22:17:08,946 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 22:17:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:17:09,183 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2022-04-14 22:17:09,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 22:17:09,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-14 22:17:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 22:17:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 22:17:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-14 22:17:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 22:17:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-14 22:17:09,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-14 22:17:09,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 22:17:09,259 INFO L225 Difference]: With dead ends: 50 [2022-04-14 22:17:09,259 INFO L226 Difference]: Without dead ends: 50 [2022-04-14 22:17:09,259 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 22:17:09,261 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 22:17:09,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 131 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 22:17:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-14 22:17:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-04-14 22:17:09,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 22:17:09,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 22:17:09,271 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 22:17:09,273 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 22:17:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:17:09,284 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2022-04-14 22:17:09,284 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-14 22:17:09,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:17:09,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:17:09,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 50 states. [2022-04-14 22:17:09,288 INFO L87 Difference]: Start difference. First operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 50 states. [2022-04-14 22:17:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 22:17:09,291 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2022-04-14 22:17:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-14 22:17:09,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 22:17:09,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 22:17:09,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 22:17:09,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 22:17:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 22:17:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-14 22:17:09,297 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 43 [2022-04-14 22:17:09,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 22:17:09,297 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-14 22:17:09,297 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-14 22:17:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-14 22:17:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-14 22:17:09,298 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 22:17:09,298 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 22:17:09,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-14 22:17:09,508 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-14 22:17:09,508 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 22:17:09,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 22:17:09,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1780836073, now seen corresponding path program 1 times [2022-04-14 22:17:09,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 22:17:09,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476885985] [2022-04-14 22:17:09,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:17:09,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 22:17:09,533 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 22:17:09,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2035593888] [2022-04-14 22:17:09,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 22:17:09,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 22:17:09,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 22:17:09,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 22:17:09,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process