/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 12:44:31,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 12:44:31,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 12:44:31,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 12:44:31,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 12:44:31,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 12:44:31,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 12:44:31,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 12:44:31,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 12:44:31,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 12:44:31,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 12:44:31,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 12:44:31,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 12:44:31,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 12:44:31,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 12:44:31,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 12:44:31,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 12:44:31,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 12:44:31,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 12:44:31,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 12:44:31,837 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 12:44:31,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 12:44:31,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 12:44:31,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 12:44:31,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 12:44:31,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 12:44:31,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 12:44:31,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 12:44:31,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 12:44:31,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 12:44:31,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 12:44:31,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 12:44:31,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 12:44:31,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 12:44:31,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 12:44:31,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 12:44:31,845 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 12:44:31,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 12:44:31,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 12:44:31,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 12:44:31,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 12:44:31,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 12:44:31,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 12:44:31,852 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 12:44:31,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 12:44:31,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 12:44:31,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 12:44:31,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 12:44:31,854 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 12:44:31,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 12:44:31,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 12:44:31,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 12:44:31,854 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 12:44:31,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 12:44:31,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 12:44:31,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 12:44:31,855 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 12:44:31,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 12:44:31,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:44:31,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 12:44:31,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 12:44:31,855 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 12:44:31,856 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 12:44:31,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 12:44:31,856 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 12:44:31,856 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 12:44:32,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 12:44:32,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 12:44:32,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 12:44:32,040 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 12:44:32,044 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 12:44:32,046 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound2.c [2022-04-08 12:44:32,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57ca895a/fb6cbec479e1499dacf4e071144b6268/FLAGcb45990bd [2022-04-08 12:44:32,500 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 12:44:32,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound2.c [2022-04-08 12:44:32,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57ca895a/fb6cbec479e1499dacf4e071144b6268/FLAGcb45990bd [2022-04-08 12:44:32,891 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57ca895a/fb6cbec479e1499dacf4e071144b6268 [2022-04-08 12:44:32,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 12:44:32,896 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 12:44:32,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 12:44:32,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 12:44:32,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 12:44:32,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:44:32" (1/1) ... [2022-04-08 12:44:32,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f8a4abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:32, skipping insertion in model container [2022-04-08 12:44:32,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:44:32" (1/1) ... [2022-04-08 12:44:32,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 12:44:32,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 12:44:33,033 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/geo2-ll_unwindbound2.c[525,538] [2022-04-08 12:44:33,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:44:33,061 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 12:44:33,068 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/geo2-ll_unwindbound2.c[525,538] [2022-04-08 12:44:33,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:44:33,081 INFO L208 MainTranslator]: Completed translation [2022-04-08 12:44:33,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:33 WrapperNode [2022-04-08 12:44:33,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 12:44:33,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 12:44:33,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 12:44:33,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 12:44:33,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:33" (1/1) ... [2022-04-08 12:44:33,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:33" (1/1) ... [2022-04-08 12:44:33,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:33" (1/1) ... [2022-04-08 12:44:33,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:33" (1/1) ... [2022-04-08 12:44:33,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:33" (1/1) ... [2022-04-08 12:44:33,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:33" (1/1) ... [2022-04-08 12:44:33,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:33" (1/1) ... [2022-04-08 12:44:33,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 12:44:33,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 12:44:33,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 12:44:33,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 12:44:33,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:33" (1/1) ... [2022-04-08 12:44:33,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:44:33,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:44:33,142 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-08 12:44:33,148 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-08 12:44:33,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 12:44:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 12:44:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 12:44:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 12:44:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 12:44:33,168 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 12:44:33,168 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 12:44:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 12:44:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 12:44:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 12:44:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 12:44:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 12:44:33,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 12:44:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 12:44:33,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 12:44:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 12:44:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 12:44:33,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 12:44:33,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 12:44:33,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 12:44:33,211 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 12:44:33,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 12:44:33,296 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 12:44:33,300 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 12:44:33,301 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 12:44:33,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:44:33 BoogieIcfgContainer [2022-04-08 12:44:33,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 12:44:33,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 12:44:33,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 12:44:33,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 12:44:33,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:44:32" (1/3) ... [2022-04-08 12:44:33,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443874e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:44:33, skipping insertion in model container [2022-04-08 12:44:33,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:44:33" (2/3) ... [2022-04-08 12:44:33,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443874e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:44:33, skipping insertion in model container [2022-04-08 12:44:33,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:44:33" (3/3) ... [2022-04-08 12:44:33,306 INFO L111 eAbstractionObserver]: Analyzing ICFG geo2-ll_unwindbound2.c [2022-04-08 12:44:33,309 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 12:44:33,309 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 12:44:33,332 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 12:44:33,336 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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-08 12:44:33,337 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 12:44:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 12:44:33,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 12:44:33,352 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:44:33,352 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:44:33,353 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:44:33,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:44:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-08 12:44:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:33,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1270888974] [2022-04-08 12:44:33,369 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:44:33,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times [2022-04-08 12:44:33,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:44:33,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579358355] [2022-04-08 12:44:33,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:44:33,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:44:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:33,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 12:44:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:33,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-08 12:44:33,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 12:44:33,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-08 12:44:33,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 12:44:33,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-08 12:44:33,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 12:44:33,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-08 12:44:33,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret7 := main(); {25#true} is VALID [2022-04-08 12:44:33,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {25#true} is VALID [2022-04-08 12:44:33,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-08 12:44:33,506 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-08 12:44:33,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-08 12:44:33,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-08 12:44:33,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 12:44:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 12:44:33,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:44:33,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579358355] [2022-04-08 12:44:33,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579358355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:33,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:33,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 12:44:33,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:44:33,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1270888974] [2022-04-08 12:44:33,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1270888974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:33,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:33,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 12:44:33,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997510634] [2022-04-08 12:44:33,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:44:33,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 12:44:33,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:44:33,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:33,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:33,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 12:44:33,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:33,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 12:44:33,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 12:44:33,556 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:33,669 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-08 12:44:33,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 12:44:33,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 12:44:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:44:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-08 12:44:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-08 12:44:33,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-08 12:44:33,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:33,758 INFO L225 Difference]: With dead ends: 39 [2022-04-08 12:44:33,759 INFO L226 Difference]: Without dead ends: 18 [2022-04-08 12:44:33,760 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 12:44:33,763 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:44:33,774 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:44:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-08 12:44:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-08 12:44:33,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:44:33,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:44:33,794 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:44:33,794 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:44:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:33,802 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 12:44:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 12:44:33,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:33,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:33,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-08 12:44:33,803 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-08 12:44:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:33,805 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-08 12:44:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-08 12:44:33,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:33,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:33,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:44:33,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:44:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:44:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 12:44:33,808 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-08 12:44:33,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:44:33,808 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 12:44:33,809 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:33,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 12:44:33,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:33,835 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 12:44:33,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 12:44:33,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:44:33,835 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:44:33,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 12:44:33,836 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:44:33,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:44:33,836 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-08 12:44:33,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:33,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1690567796] [2022-04-08 12:44:33,838 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:44:33,838 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times [2022-04-08 12:44:33,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:44:33,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515613848] [2022-04-08 12:44:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:44:33,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:44:33,850 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:44:33,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714697184] [2022-04-08 12:44:33,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:44:33,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:44:33,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:44:33,852 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-08 12:44:33,853 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-08 12:44:33,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:44:33,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:44:33,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 12:44:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:33,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:44:34,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2022-04-08 12:44:34,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {189#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:34,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#(<= ~counter~0 0)} assume true; {189#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:34,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#(<= ~counter~0 0)} {181#true} #54#return; {189#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:34,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#(<= ~counter~0 0)} call #t~ret7 := main(); {189#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:34,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#(<= ~counter~0 0)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {189#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:34,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {205#(<= |main_#t~post6| 0)} is VALID [2022-04-08 12:44:34,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {205#(<= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {182#false} is VALID [2022-04-08 12:44:34,016 INFO L272 TraceCheckUtils]: 8: Hoare triple {182#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {182#false} is VALID [2022-04-08 12:44:34,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#false} ~cond := #in~cond; {182#false} is VALID [2022-04-08 12:44:34,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#false} assume 0 == ~cond; {182#false} is VALID [2022-04-08 12:44:34,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {182#false} assume !false; {182#false} is VALID [2022-04-08 12:44:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 12:44:34,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:44:34,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:44:34,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515613848] [2022-04-08 12:44:34,017 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:44:34,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714697184] [2022-04-08 12:44:34,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714697184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:34,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:34,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:44:34,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:44:34,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1690567796] [2022-04-08 12:44:34,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1690567796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:34,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:34,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:44:34,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358878013] [2022-04-08 12:44:34,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:44:34,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 12:44:34,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:44:34,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:34,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:34,030 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:44:34,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:34,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:44:34,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:44:34,031 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:34,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:34,064 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-08 12:44:34,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 12:44:34,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 12:44:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:44:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-08 12:44:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-08 12:44:34,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-08 12:44:34,087 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-08 12:44:34,088 INFO L225 Difference]: With dead ends: 26 [2022-04-08 12:44:34,088 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 12:44:34,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:44:34,089 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:44:34,090 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:44:34,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 12:44:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 12:44:34,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:44:34,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:44:34,096 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:44:34,097 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:44:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:34,098 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 12:44:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 12:44:34,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:34,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:34,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-08 12:44:34,099 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-08 12:44:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:34,100 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 12:44:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 12:44:34,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:34,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:34,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:44:34,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:44:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:44:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-08 12:44:34,102 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-08 12:44:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:44:34,102 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-08 12:44:34,103 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:34,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-08 12:44:34,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 12:44:34,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 12:44:34,121 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:44:34,121 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:44:34,137 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-08 12:44:34,326 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-08 12:44:34,326 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:44:34,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:44:34,327 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-08 12:44:34,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:34,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [921038415] [2022-04-08 12:44:34,328 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:44:34,328 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times [2022-04-08 12:44:34,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:44:34,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794884175] [2022-04-08 12:44:34,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:44:34,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:44:34,339 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:44:34,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112116901] [2022-04-08 12:44:34,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:44:34,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:44:34,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:44:34,340 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-08 12:44:34,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 12:44:34,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:44:34,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:44:34,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 12:44:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:34,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:44:34,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-08 12:44:34,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {348#true} is VALID [2022-04-08 12:44:34,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-08 12:44:34,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #54#return; {348#true} is VALID [2022-04-08 12:44:34,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret7 := main(); {348#true} is VALID [2022-04-08 12:44:34,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {368#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-08 12:44:34,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(and (= main_~y~0 1) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {368#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-08 12:44:34,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {368#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-08 12:44:34,490 INFO L272 TraceCheckUtils]: 8: Hoare triple {368#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:44:34,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:44:34,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {349#false} is VALID [2022-04-08 12:44:34,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-08 12:44:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 12:44:34,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:44:34,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:44:34,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794884175] [2022-04-08 12:44:34,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:44:34,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112116901] [2022-04-08 12:44:34,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112116901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:34,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:34,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:44:34,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:44:34,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [921038415] [2022-04-08 12:44:34,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [921038415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:34,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:34,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:44:34,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083909458] [2022-04-08 12:44:34,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:44:34,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 12:44:34,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:44:34,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:34,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:34,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:44:34,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:34,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:44:34,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:44:34,503 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:34,574 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-08 12:44:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:44:34,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 12:44:34,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:44:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-08 12:44:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-08 12:44:34,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-08 12:44:34,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:34,599 INFO L225 Difference]: With dead ends: 28 [2022-04-08 12:44:34,599 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 12:44:34,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-08 12:44:34,600 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:44:34,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:44:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 12:44:34,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 12:44:34,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:44:34,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 12:44:34,611 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 12:44:34,611 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 12:44:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:34,612 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 12:44:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 12:44:34,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:34,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:34,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 12:44:34,613 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 12:44:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:34,614 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 12:44:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 12:44:34,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:34,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:34,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:44:34,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:44:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 12:44:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-08 12:44:34,615 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-08 12:44:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:44:34,615 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-08 12:44:34,616 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 12:44:34,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-08 12:44:34,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 12:44:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 12:44:34,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:44:34,637 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:44:34,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 12:44:34,853 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 12:44:34,854 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:44:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:44:34,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-08 12:44:34,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:34,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1425275618] [2022-04-08 12:44:45,407 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 12:44:45,407 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 12:44:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 2 times [2022-04-08 12:44:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:44:45,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627033998] [2022-04-08 12:44:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:44:45,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:44:45,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:44:45,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625098097] [2022-04-08 12:44:45,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:44:45,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:44:45,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:44:45,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:44:45,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 12:44:45,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:44:45,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:44:45,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 12:44:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:45,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:44:45,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-08 12:44:45,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #54#return; {554#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {554#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {570#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {570#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,593 INFO L272 TraceCheckUtils]: 8: Hoare triple {570#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {570#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {570#(<= ~counter~0 1)} ~cond := #in~cond; {570#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {570#(<= ~counter~0 1)} assume !(0 == ~cond); {570#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {570#(<= ~counter~0 1)} assume true; {570#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,595 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {570#(<= ~counter~0 1)} {570#(<= ~counter~0 1)} #50#return; {570#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {570#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {570#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {570#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {595#(<= |main_#t~post6| 1)} is VALID [2022-04-08 12:44:45,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {595#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {547#false} is VALID [2022-04-08 12:44:45,597 INFO L272 TraceCheckUtils]: 16: Hoare triple {547#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {547#false} is VALID [2022-04-08 12:44:45,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-08 12:44:45,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-08 12:44:45,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-08 12:44:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 12:44:45,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:44:45,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-08 12:44:45,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-08 12:44:45,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-08 12:44:45,701 INFO L272 TraceCheckUtils]: 16: Hoare triple {547#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {547#false} is VALID [2022-04-08 12:44:45,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {595#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {547#false} is VALID [2022-04-08 12:44:45,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {570#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {595#(<= |main_#t~post6| 1)} is VALID [2022-04-08 12:44:45,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {570#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {570#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,703 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {546#true} {570#(<= ~counter~0 1)} #50#return; {570#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#true} assume true; {546#true} is VALID [2022-04-08 12:44:45,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {546#true} assume !(0 == ~cond); {546#true} is VALID [2022-04-08 12:44:45,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {546#true} ~cond := #in~cond; {546#true} is VALID [2022-04-08 12:44:45,704 INFO L272 TraceCheckUtils]: 8: Hoare triple {570#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {546#true} is VALID [2022-04-08 12:44:45,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {570#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {570#(<= ~counter~0 1)} is VALID [2022-04-08 12:44:45,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {554#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #54#return; {554#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-08 12:44:45,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-08 12:44:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 12:44:45,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:44:45,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627033998] [2022-04-08 12:44:45,708 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:44:45,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625098097] [2022-04-08 12:44:45,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625098097] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:44:45,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:44:45,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-08 12:44:45,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:44:45,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1425275618] [2022-04-08 12:44:45,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1425275618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:44:45,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:44:45,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:44:45,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590379948] [2022-04-08 12:44:45,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:44:45,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 12:44:45,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:44:45,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:44:45,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:45,723 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:44:45,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:45,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:44:45,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:44:45,724 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:44:45,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:45,780 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-08 12:44:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 12:44:45,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 12:44:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:44:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:44:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-08 12:44:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:44:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-08 12:44:45,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-08 12:44:45,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:45,806 INFO L225 Difference]: With dead ends: 34 [2022-04-08 12:44:45,806 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 12:44:45,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 12:44:45,807 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:44:45,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:44:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 12:44:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 12:44:45,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:44:45,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 12:44:45,820 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 12:44:45,820 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 12:44:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:45,821 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-08 12:44:45,822 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-08 12:44:45,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:45,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:45,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 12:44:45,822 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 12:44:45,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:44:45,823 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-08 12:44:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-08 12:44:45,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:44:45,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:44:45,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:44:45,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:44:45,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 12:44:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-08 12:44:45,825 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2022-04-08 12:44:45,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:44:45,825 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-08 12:44:45,825 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:44:45,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-08 12:44:45,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:44:45,847 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-08 12:44:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 12:44:45,848 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:44:45,848 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:44:45,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 12:44:46,063 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:44:46,063 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:44:46,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:44:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-08 12:44:46,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:44:46,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [169584323] [2022-04-08 12:44:53,744 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 12:44:53,745 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 12:44:53,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 2 times [2022-04-08 12:44:53,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:44:53,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997819751] [2022-04-08 12:44:53,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:44:53,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:44:53,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:44:53,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512676139] [2022-04-08 12:44:53,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:44:53,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:44:53,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:44:53,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:44:53,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 12:44:53,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:44:53,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:44:53,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 12:44:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:44:53,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:44:53,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2022-04-08 12:44:53,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {848#true} is VALID [2022-04-08 12:44:53,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2022-04-08 12:44:53,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #54#return; {848#true} is VALID [2022-04-08 12:44:53,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret7 := main(); {848#true} is VALID [2022-04-08 12:44:53,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {848#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {868#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-08 12:44:53,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {868#(and (= main_~y~0 1) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {868#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-08 12:44:53,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {868#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {868#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-08 12:44:53,944 INFO L272 TraceCheckUtils]: 8: Hoare triple {868#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {848#true} is VALID [2022-04-08 12:44:53,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {848#true} ~cond := #in~cond; {881#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:44:53,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {881#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {885#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:44:53,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {885#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {885#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:44:53,946 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {885#(not (= |__VERIFIER_assert_#in~cond| 0))} {868#(and (= main_~y~0 1) (= main_~x~0 1))} #50#return; {868#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-08 12:44:53,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {868#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {895#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-08 12:44:53,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {895#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-08 12:44:53,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} assume !!(#t~post6 < 2);havoc #t~post6; {895#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-08 12:44:53,948 INFO L272 TraceCheckUtils]: 16: Hoare triple {895#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {905#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:44:53,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:44:53,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {849#false} is VALID [2022-04-08 12:44:53,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {849#false} assume !false; {849#false} is VALID [2022-04-08 12:44:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 12:44:53,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:45:06,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {849#false} assume !false; {849#false} is VALID [2022-04-08 12:45:06,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {849#false} is VALID [2022-04-08 12:45:06,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:45:06,992 INFO L272 TraceCheckUtils]: 16: Hoare triple {925#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {905#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:45:06,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {925#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} assume !!(#t~post6 < 2);havoc #t~post6; {925#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-08 12:45:06,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {925#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {925#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-08 12:45:06,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {935#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {925#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-08 12:45:06,997 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {885#(not (= |__VERIFIER_assert_#in~cond| 0))} {848#true} #50#return; {935#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-08 12:45:06,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {885#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {885#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:45:06,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {948#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {885#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:45:06,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {848#true} ~cond := #in~cond; {948#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:45:06,999 INFO L272 TraceCheckUtils]: 8: Hoare triple {848#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {848#true} is VALID [2022-04-08 12:45:06,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {848#true} assume !!(#t~post6 < 2);havoc #t~post6; {848#true} is VALID [2022-04-08 12:45:06,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {848#true} is VALID [2022-04-08 12:45:06,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {848#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {848#true} is VALID [2022-04-08 12:45:06,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {848#true} call #t~ret7 := main(); {848#true} is VALID [2022-04-08 12:45:06,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {848#true} {848#true} #54#return; {848#true} is VALID [2022-04-08 12:45:06,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {848#true} assume true; {848#true} is VALID [2022-04-08 12:45:06,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {848#true} is VALID [2022-04-08 12:45:06,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {848#true} call ULTIMATE.init(); {848#true} is VALID [2022-04-08 12:45:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 12:45:07,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:45:07,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997819751] [2022-04-08 12:45:07,000 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:45:07,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512676139] [2022-04-08 12:45:07,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512676139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:45:07,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:45:07,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-08 12:45:07,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:45:07,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [169584323] [2022-04-08 12:45:07,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [169584323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:45:07,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:45:07,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:45:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718855097] [2022-04-08 12:45:07,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:45:07,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 12:45:07,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:45:07,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:45:07,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:45:07,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:45:07,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:45:07,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:45:07,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-08 12:45:07,022 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:45:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:07,237 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 12:45:07,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 12:45:07,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 12:45:07,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:45:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:45:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-08 12:45:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:45:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-08 12:45:07,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2022-04-08 12:45:07,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:45:07,278 INFO L225 Difference]: With dead ends: 36 [2022-04-08 12:45:07,278 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 12:45:07,279 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 12:45:07,281 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 12:45:07,281 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 92 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 12:45:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 12:45:07,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 12:45:07,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:45:07,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 12:45:07,300 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 12:45:07,301 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 12:45:07,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:07,302 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 12:45:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 12:45:07,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:45:07,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:45:07,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-08 12:45:07,304 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-08 12:45:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:45:07,307 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 12:45:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 12:45:07,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:45:07,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:45:07,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:45:07,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:45:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 12:45:07,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-08 12:45:07,311 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2022-04-08 12:45:07,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:45:07,311 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-08 12:45:07,311 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 12:45:07,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-08 12:45:07,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:45:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 12:45:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 12:45:07,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:45:07,348 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:45:07,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 12:45:07,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:45:07,564 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:45:07,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:45:07,564 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 3 times [2022-04-08 12:45:07,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:45:07,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1436256197] [2022-04-08 12:45:16,497 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 12:45:16,498 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 12:45:16,498 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 4 times [2022-04-08 12:45:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:45:16,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524025397] [2022-04-08 12:45:16,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:45:16,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:45:16,510 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:45:16,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847260371] [2022-04-08 12:45:16,511 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:45:16,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:45:16,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:45:16,513 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:45:16,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 12:45:16,800 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:45:16,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:45:16,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 12:45:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:45:16,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:45:25,465 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 12:46:11,397 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 12:46:16,702 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 12:46:26,010 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 12:46:28,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {1186#true} call ULTIMATE.init(); {1186#true} is VALID [2022-04-08 12:46:28,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {1186#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1186#true} is VALID [2022-04-08 12:46:28,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {1186#true} assume true; {1186#true} is VALID [2022-04-08 12:46:28,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1186#true} {1186#true} #54#return; {1186#true} is VALID [2022-04-08 12:46:28,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {1186#true} call #t~ret7 := main(); {1186#true} is VALID [2022-04-08 12:46:28,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {1186#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {1186#true} is VALID [2022-04-08 12:46:28,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {1186#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1186#true} is VALID [2022-04-08 12:46:28,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {1186#true} assume !!(#t~post6 < 2);havoc #t~post6; {1186#true} is VALID [2022-04-08 12:46:28,556 INFO L272 TraceCheckUtils]: 8: Hoare triple {1186#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1186#true} is VALID [2022-04-08 12:46:28,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {1186#true} ~cond := #in~cond; {1218#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:46:28,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {1218#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1222#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:46:28,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {1222#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1222#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:46:28,558 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1222#(not (= |__VERIFIER_assert_#in~cond| 0))} {1186#true} #50#return; {1229#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-08 12:46:30,560 WARN L290 TraceCheckUtils]: 13: Hoare triple {1229#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {1233#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} is UNKNOWN [2022-04-08 12:46:30,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1233#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} is VALID [2022-04-08 12:46:30,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} assume !!(#t~post6 < 2);havoc #t~post6; {1233#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} is VALID [2022-04-08 12:46:30,564 INFO L272 TraceCheckUtils]: 16: Hoare triple {1233#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1186#true} is VALID [2022-04-08 12:46:30,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {1186#true} ~cond := #in~cond; {1218#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:46:30,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {1218#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1222#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:46:30,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {1222#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1222#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:46:30,566 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1222#(not (= |__VERIFIER_assert_#in~cond| 0))} {1233#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} #50#return; {1255#(and (or (and (= (mod main_~y~0 main_~z~0) 0) (not (= main_~z~0 0))) (= main_~y~0 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)))} is VALID [2022-04-08 12:46:32,568 WARN L290 TraceCheckUtils]: 21: Hoare triple {1255#(and (or (and (= (mod main_~y~0 main_~z~0) 0) (not (= main_~z~0 0))) (= main_~y~0 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {1259#(or (and (= main_~z~0 0) (= main_~x~0 1) (= main_~y~0 0)) (and (= (mod (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) 0) (= (mod (+ (- 1) main_~x~0) main_~z~0) 0) (not (= main_~z~0 0)) (= main_~y~0 (* main_~z~0 (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0))) (= (mod (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) main_~z~0) 0)))} is UNKNOWN [2022-04-08 12:46:32,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {1259#(or (and (= main_~z~0 0) (= main_~x~0 1) (= main_~y~0 0)) (and (= (mod (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) 0) (= (mod (+ (- 1) main_~x~0) main_~z~0) 0) (not (= main_~z~0 0)) (= main_~y~0 (* main_~z~0 (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0))) (= (mod (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) main_~z~0) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1259#(or (and (= main_~z~0 0) (= main_~x~0 1) (= main_~y~0 0)) (and (= (mod (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) 0) (= (mod (+ (- 1) main_~x~0) main_~z~0) 0) (not (= main_~z~0 0)) (= main_~y~0 (* main_~z~0 (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0))) (= (mod (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) main_~z~0) 0)))} is VALID [2022-04-08 12:46:32,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {1259#(or (and (= main_~z~0 0) (= main_~x~0 1) (= main_~y~0 0)) (and (= (mod (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) 0) (= (mod (+ (- 1) main_~x~0) main_~z~0) 0) (not (= main_~z~0 0)) (= main_~y~0 (* main_~z~0 (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0))) (= (mod (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) main_~z~0) 0)))} assume !(#t~post6 < 2);havoc #t~post6; {1259#(or (and (= main_~z~0 0) (= main_~x~0 1) (= main_~y~0 0)) (and (= (mod (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) 0) (= (mod (+ (- 1) main_~x~0) main_~z~0) 0) (not (= main_~z~0 0)) (= main_~y~0 (* main_~z~0 (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0))) (= (mod (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) main_~z~0) 0)))} is VALID [2022-04-08 12:46:32,578 INFO L272 TraceCheckUtils]: 24: Hoare triple {1259#(or (and (= main_~z~0 0) (= main_~x~0 1) (= main_~y~0 0)) (and (= (mod (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) 0) (= (mod (+ (- 1) main_~x~0) main_~z~0) 0) (not (= main_~z~0 0)) (= main_~y~0 (* main_~z~0 (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0))) (= (mod (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) main_~z~0) 0)))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:46:32,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1273#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:46:32,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {1273#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1187#false} is VALID [2022-04-08 12:46:32,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2022-04-08 12:46:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:46:32,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:47:03,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {1187#false} assume !false; {1187#false} is VALID [2022-04-08 12:47:03,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {1273#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1187#false} is VALID [2022-04-08 12:47:03,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1273#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:47:03,605 INFO L272 TraceCheckUtils]: 24: Hoare triple {1229#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 12:47:03,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {1229#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} assume !(#t~post6 < 2);havoc #t~post6; {1229#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-08 12:47:03,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {1229#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1229#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-08 12:47:03,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {1298#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {1229#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-08 12:47:03,611 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1222#(not (= |__VERIFIER_assert_#in~cond| 0))} {1186#true} #50#return; {1298#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-08 12:47:03,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {1222#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1222#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:47:03,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {1311#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1222#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 12:47:03,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {1186#true} ~cond := #in~cond; {1311#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 12:47:03,612 INFO L272 TraceCheckUtils]: 16: Hoare triple {1186#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1186#true} is VALID [2022-04-08 12:47:03,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {1186#true} assume !!(#t~post6 < 2);havoc #t~post6; {1186#true} is VALID [2022-04-08 12:47:03,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {1186#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1186#true} is VALID [2022-04-08 12:47:03,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {1186#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {1186#true} is VALID [2022-04-08 12:47:03,613 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1186#true} {1186#true} #50#return; {1186#true} is VALID [2022-04-08 12:47:03,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {1186#true} assume true; {1186#true} is VALID [2022-04-08 12:47:03,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {1186#true} assume !(0 == ~cond); {1186#true} is VALID [2022-04-08 12:47:03,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {1186#true} ~cond := #in~cond; {1186#true} is VALID [2022-04-08 12:47:03,613 INFO L272 TraceCheckUtils]: 8: Hoare triple {1186#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1186#true} is VALID [2022-04-08 12:47:03,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {1186#true} assume !!(#t~post6 < 2);havoc #t~post6; {1186#true} is VALID [2022-04-08 12:47:03,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {1186#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1186#true} is VALID [2022-04-08 12:47:03,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {1186#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {1186#true} is VALID [2022-04-08 12:47:03,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {1186#true} call #t~ret7 := main(); {1186#true} is VALID [2022-04-08 12:47:03,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1186#true} {1186#true} #54#return; {1186#true} is VALID [2022-04-08 12:47:03,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {1186#true} assume true; {1186#true} is VALID [2022-04-08 12:47:03,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {1186#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1186#true} is VALID [2022-04-08 12:47:03,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {1186#true} call ULTIMATE.init(); {1186#true} is VALID [2022-04-08 12:47:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 12:47:03,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:47:03,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524025397] [2022-04-08 12:47:03,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:47:03,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847260371] [2022-04-08 12:47:03,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847260371] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:47:03,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:47:03,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-04-08 12:47:03,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:47:03,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1436256197] [2022-04-08 12:47:03,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1436256197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:47:03,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:47:03,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 12:47:03,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691523401] [2022-04-08 12:47:03,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:47:03,616 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-08 12:47:03,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:47:03,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:47:07,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 23 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 12:47:07,656 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 12:47:07,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:47:07,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 12:47:07,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-08 12:47:07,657 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:47:09,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:47:11,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:47:20,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:47:23,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:47:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:23,193 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 12:47:23,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 12:47:23,194 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-08 12:47:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:47:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:47:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-08 12:47:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:47:23,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-08 12:47:23,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2022-04-08 12:47:29,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 26 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 12:47:29,245 INFO L225 Difference]: With dead ends: 33 [2022-04-08 12:47:29,245 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 12:47:29,245 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-08 12:47:29,247 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-04-08 12:47:29,247 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 99 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 4 Unknown, 9 Unchecked, 8.8s Time] [2022-04-08 12:47:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 12:47:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 12:47:29,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:47:29,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 12:47:29,247 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 12:47:29,248 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 12:47:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:29,248 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 12:47:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 12:47:29,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:47:29,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:47:29,248 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 12:47:29,248 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 12:47:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:47:29,248 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 12:47:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 12:47:29,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:47:29,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:47:29,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:47:29,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:47:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 12:47:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 12:47:29,249 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-08 12:47:29,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:47:29,249 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 12:47:29,249 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 12:47:29,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 12:47:29,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:47:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 12:47:29,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:47:29,251 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 12:47:29,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 12:47:29,451 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:47:29,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 12:47:32,960 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-08 12:47:32,961 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-08 12:47:32,961 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-08 12:47:32,961 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-08 12:47:32,961 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-08 12:47:32,961 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-08 12:47:32,961 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-08 12:47:32,961 INFO L878 garLoopResultBuilder]: At program point L34-1(lines 34 43) the Hoare annotation is: (let ((.cse1 (= main_~z~0 0))) (let ((.cse0 (= main_~x~0 1)) (.cse4 (not .cse1))) (or (and (<= ~counter~0 1) (= main_~y~0 1) .cse0 (<= |main_#t~post6| 0)) (and .cse1 .cse0 (= main_~y~0 0)) (let ((.cse3 (+ (- 1) main_~x~0))) (let ((.cse2 (let ((.cse6 (div .cse3 main_~z~0))) (+ (* main_~z~0 .cse6) (* (- 1) .cse6) 1)))) (let ((.cse5 (div .cse2 main_~z~0))) (and (= (mod .cse2 main_~z~0) 0) (= (mod .cse3 main_~z~0) 0) .cse4 (= main_~y~0 (* main_~z~0 .cse5)) (= (mod .cse5 main_~z~0) 0))))) (not (<= |old(~counter~0)| 0)) (and (<= |main_#t~post6| 1) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) .cse4 (= main_~x~0 (+ main_~z~0 1)))))) [2022-04-08 12:47:32,961 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (let ((.cse2 (= main_~z~0 0))) (let ((.cse1 (= main_~x~0 1)) (.cse0 (not .cse2))) (or (and (<= ~counter~0 1) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) .cse0 (= main_~x~0 (+ main_~z~0 1))) (and (= main_~y~0 1) (<= ~counter~0 0) .cse1) (and .cse2 .cse1 (= main_~y~0 0)) (let ((.cse4 (+ (- 1) main_~x~0))) (let ((.cse3 (let ((.cse6 (div .cse4 main_~z~0))) (+ (* main_~z~0 .cse6) (* (- 1) .cse6) 1)))) (let ((.cse5 (div .cse3 main_~z~0))) (and (= (mod .cse3 main_~z~0) 0) (= (mod .cse4 main_~z~0) 0) .cse0 (= main_~y~0 (* main_~z~0 .cse5)) (= (mod .cse5 main_~z~0) 0))))) (not (<= |old(~counter~0)| 0))))) [2022-04-08 12:47:32,961 INFO L878 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (or (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1))) (and (= main_~y~0 1) (= main_~x~0 1)) (let ((.cse1 (+ (- 1) main_~x~0))) (let ((.cse0 (let ((.cse3 (div .cse1 main_~z~0))) (+ (* main_~z~0 .cse3) (* (- 1) .cse3) 1)))) (let ((.cse2 (div .cse0 main_~z~0))) (and (= (mod .cse0 main_~z~0) 0) (= (mod .cse1 main_~z~0) 0) (not (= main_~z~0 0)) (= main_~y~0 (* main_~z~0 .cse2)) (= (mod .cse2 main_~z~0) 0))))) (not (<= |old(~counter~0)| 0))) [2022-04-08 12:47:32,961 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 24 46) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-08 12:47:32,961 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 46) the Hoare annotation is: true [2022-04-08 12:47:32,961 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 46) the Hoare annotation is: true [2022-04-08 12:47:32,961 INFO L885 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: true [2022-04-08 12:47:32,962 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse2 (not (= main_~z~0 0)))) (or (and (<= ~counter~0 1) (= main_~y~0 1) (= main_~x~0 1)) (let ((.cse1 (+ (- 1) main_~x~0))) (let ((.cse0 (let ((.cse4 (div .cse1 main_~z~0))) (+ (* main_~z~0 .cse4) (* (- 1) .cse4) 1)))) (let ((.cse3 (div .cse0 main_~z~0))) (and (= (mod .cse0 main_~z~0) 0) (= (mod .cse1 main_~z~0) 0) .cse2 (= main_~y~0 (* main_~z~0 .cse3)) (= (mod .cse3 main_~z~0) 0))))) (not (<= |old(~counter~0)| 0)) (and (or .cse2 (= main_~y~0 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) (= main_~x~0 (+ main_~z~0 1))))) [2022-04-08 12:47:32,962 INFO L878 garLoopResultBuilder]: At program point L35-1(lines 34 43) the Hoare annotation is: (let ((.cse2 (not (= main_~z~0 0)))) (or (and (<= ~counter~0 1) (= main_~y~0 1) (= main_~x~0 1)) (let ((.cse1 (+ (- 1) main_~x~0))) (let ((.cse0 (let ((.cse4 (div .cse1 main_~z~0))) (+ (* main_~z~0 .cse4) (* (- 1) .cse4) 1)))) (let ((.cse3 (div .cse0 main_~z~0))) (and (= (mod .cse0 main_~z~0) 0) (= (mod .cse1 main_~z~0) 0) .cse2 (= main_~y~0 (* main_~z~0 .cse3)) (= (mod .cse3 main_~z~0) 0))))) (not (<= |old(~counter~0)| 0)) (and (or .cse2 (= main_~y~0 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) (= main_~x~0 (+ main_~z~0 1))))) [2022-04-08 12:47:32,962 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-08 12:47:32,962 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 12:47:32,962 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-08 12:47:32,962 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 12:47:32,962 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-08 12:47:32,962 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 12:47:32,962 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 12:47:32,962 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 12:47:32,962 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 12:47:32,962 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-08 12:47:32,962 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 12:47:32,962 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 12:47:32,962 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 12:47:32,964 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2] [2022-04-08 12:47:32,965 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 12:47:32,967 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 12:47:32,969 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 12:47:32,971 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 12:47:32,972 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 12:47:32,972 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 12:47:32,977 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-08 12:47:34,993 INFO L163 areAnnotationChecker]: CFG has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 12:47:35,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:47:35 BoogieIcfgContainer [2022-04-08 12:47:35,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 12:47:35,004 INFO L158 Benchmark]: Toolchain (without parser) took 182107.73ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 147.8MB in the beginning and 120.5MB in the end (delta: 27.3MB). Peak memory consumption was 67.5MB. Max. memory is 8.0GB. [2022-04-08 12:47:35,004 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 202.4MB. Free memory is still 164.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 12:47:35,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.95ms. Allocated memory is still 202.4MB. Free memory was 147.5MB in the beginning and 174.2MB in the end (delta: -26.7MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2022-04-08 12:47:35,004 INFO L158 Benchmark]: Boogie Preprocessor took 18.55ms. Allocated memory is still 202.4MB. Free memory was 174.2MB in the beginning and 172.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 12:47:35,004 INFO L158 Benchmark]: RCFGBuilder took 200.56ms. Allocated memory is still 202.4MB. Free memory was 172.8MB in the beginning and 161.9MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 12:47:35,004 INFO L158 Benchmark]: TraceAbstraction took 181700.29ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 161.6MB in the beginning and 120.5MB in the end (delta: 41.1MB). Peak memory consumption was 83.0MB. Max. memory is 8.0GB. [2022-04-08 12:47:35,005 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 202.4MB. Free memory is still 164.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.95ms. Allocated memory is still 202.4MB. Free memory was 147.5MB in the beginning and 174.2MB in the end (delta: -26.7MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.55ms. Allocated memory is still 202.4MB. Free memory was 174.2MB in the beginning and 172.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 200.56ms. Allocated memory is still 202.4MB. Free memory was 172.8MB in the beginning and 161.9MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 181700.29ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 161.6MB in the beginning and 120.5MB in the end (delta: 41.1MB). Peak memory consumption was 83.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 179.6s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 371 SdHoareTripleChecker+Invalid, 8.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9 IncrementalHoareTripleChecker+Unchecked, 261 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 171 IncrementalHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 110 mSDtfsCounter, 171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 76 PreInvPairs, 120 NumberOfFragments, 648 HoareAnnotationTreeSize, 76 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 282 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((counter <= 1 && x + z * y == z * x + 1) && !(z == 0)) && x == z + 1) || ((y == 1 && counter <= 0) && x == 1)) || ((z == 0 && x == 1) && y == 0)) || (((((z * ((-1 + x) / z) + -1 * ((-1 + x) / z) + 1) % z == 0 && (-1 + x) % z == 0) && !(z == 0)) && y == z * ((z * ((-1 + x) / z) + -1 * ((-1 + x) / z) + 1) / z)) && (z * ((-1 + x) / z) + -1 * ((-1 + x) / z) + 1) / z % z == 0)) || !(\old(counter) <= 0) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-08 12:47:35,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...